#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int s[2];
vector<int> v[100009];

void dfs(int n, int p, int t)
{
    s[t]++;
    for (int i = 0; i < v[n].size(); i++) {
        int tn = v[n][i];
        if (tn == p) continue;
        dfs(tn, n, 1 - t);
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n; cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int a, b; cin >> a >> b;
        v[a].push_back(b); v[b].push_back(a);
    }
    dfs(1, 0, 0);
    cout << min(s[0], s[1]) << '\n';
    return 0;
}