#include <iostream>

#define Rep(i, n) for (int i = 1; i <= n; i ++)
#define RepG(i, x) for (int i = head[x]; i; i= edge[i].next)
#define v edge[i].to

using namespace std;

const int N = 1000100;
typedef long long LL;

struct Edge{ int to, next;} edge[N * 2];
int head[N], num;
void add_edge(int a, int b){edge[++ num] = (Edge){b, head[a]}, head[a] = num;}

int c[N], f[N][2], d[N];
void dfs(int x, int fa)
{
    c[x] = !c[fa];
    bool flag = false;
    RepG(i, x) if (v != fa){ dfs(v, x); flag = true;}
    if (!flag){ f[x][c[x]] = 0, f[x][!c[x]] = 1e9; return;}
    RepG(i, x) if (v != fa) f[x][c[x]] += min(f[v][c[x]], f[v][!c[x]] + 1);
    RepG(i, x) if (v != fa) f[x][!c[x]] += f[v][!c[x]];
}

int main()
{
    int n;
    cin >> n;
    Rep(i, n - 1) {
        int a, b;
        cin >> a >> b;
        add_edge(a, b);
        add_edge(b, a);
        d[a] ++, d[b] ++;
    }

    dfs(1, 0);

    if (d[1] == 1) cout << f[1][c[1]] << endl;
    else cout << min(f[1][0], f[1][1]) << endl;

    return 0;
}