#include <bits/stdc++.h>

#define pb push_back
#define f first
#define s second
 
using ll = long long;
using namespace std;

const int MOD = 1e9 + 7;

vector<vector<int>> adj;

int dfs(int node, int parent, bool wParent);

int main(){
    int N;
    cin >> N;

    if (N == 1) {
        cout << 2 << endl;
        return 0;
    }

    for (int i = 0; i < N; ++i)
    {
        adj.emplace_back();
    }

    for (int i = 0; i < N-1; ++i) {
        int a, b;
        cin >> a >> b;
        a--; b--;

        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    cout << dfs(0, -1, false) << endl;
}

int dfs(int node, int parent, bool wParent) {
    if (wParent) {
        int sum = 0;
        for (int child : adj[node]) {
            if (child == parent)
                continue;
            sum += dfs(child, node, false);
        }
        return 1 + sum;

    } else {
        int N = adj[node].size();

        if (N == 1 && parent != -1)
            return 2;

        vector<int> temp(N, 0);

        int sum = 0;
        for (int i = 0; i < N; ++i) {
            if (adj[node][i] == parent)
                continue;
            int res = dfs(adj[node][i], node, false);
            sum += res;
            temp[i] = res;
        }

        int best = 1000000000;
        for (int i = 0; i < N; ++i) {
            if (adj[node][i] == parent)
                continue;
            int res = dfs(adj[node][i], node, true);
            //cout << node << " " << res << " " << temp[i] << endl;
            best = min(best, sum + res - temp[i]);
        }

        //cout << node << " " << best << endl;
        
        return best;
    }
}