#include <bits/stdc++.h>
using namespace std;

const int MAXX = 2e5 + 5;

#define int long long

vector <int> g[MAXX];
int n;
int dpmit[MAXX];
int dpohne[MAXX];
void dfs(int x, int par) {
    if(x != 1 && g[x].size() == 1) {
        dpmit[x] = 2;
        dpohne[x] = 0;
        return;
    }
    int chs = - 1e15;
    int idx = - 1;
    int sum = 0;
    for(auto y: g[x]) {
        if(y == par) continue;
        dfs(y, x);
        sum += dpmit[y];
        if(chs < dpohne[y] - dpmit[y]) {
            chs = dpohne[y] - dpmit[y];
            idx = y;
        }
    }
    dpohne[x] = sum;
    dpmit[x] = min(sum + 2, sum - dpmit[idx] + dpohne[idx] + 1);
    // cout << x << " " << dpmit[x] << " " << dpohne[x] << endl;
    return;
}
int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    
    for(int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for(int i = 0; i < MAXX; i++) {
        dpmit[i] = dpohne[i] = 1e15;
    }

    dfs(1, - 1);

    cout << dpmit[1] << endl;


}