#include <iostream>

#define Rep(i, n) for (int i = 1; i <= n; i ++)
#define Rep0(i, n) for (int i = 0; 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], ff[N];
void dfs(int x, int fa)
{
    c[x] = !c[fa];
    int cnt = 0, tff = 0;
    RepG(i, x) if (v != fa){ 
        dfs(v, x); 
        cnt ++;
        Rep0(j, 1) f[x][j] += min(f[v][j], ff[v] + 1);
        tff += f[v][!c[x]];
    }
    if (!cnt) f[x][c[x]] = 0, f[x][!c[x]] = 1e9;

    //cout << x << " " << f[x][0] << " " << f[x][1] << endl;
    ff[x] = f[x][c[x]];
    if (cnt >= 2) ff[x] = min(ff[x], tff); 
}

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

    dfs(1, 0);

    cout << ff[1] << endl;
    return 0;
}