#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    vector<vector<int> > g(n + 1);
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    vector<int> f(n + 1), s(n + 1);
    int ans = 1e9;

    auto dfs1 = [&](auto &&dfs1, int u, int fa) -> void {
        for(auto j : g[u]){
            if (j == fa) continue;
            dfs1(dfs1, j, u);
            if (s[j] == 0){
                f[u] += f[j];
                s[u] += 1;
            }
            else{
                f[u] += f[j] + 2 * s[j] - 1;
            }
        }
    };

    auto dfs2 = [&](auto &&dfs2, int u, int fa, pair<int, int> pre) -> void {
        int sf = f[u];
        int ss = s[u];
        if (u == 1){

        }
        else if (pre.second == 0){
            sf += pre.first;
            ss += 1;
        }
        else{
            sf += pre.first + 2 * (pre.second) - 1;
        }
        if (ss == 0){
            ans = min(ans, sf + 2);
        }
        else{
            ans = min(ans, sf + 2 * ss - 1);
        }

        for(auto j : g[u]){
            if (j == fa) continue;
            int nf = sf;
            int ns = ss;
            if (s[j] == 0){
                nf -= f[j];
                ss -= 1;
            }
            else{
                nf -= f[j] + 2 * s[j] - 1;
            }
            dfs2(dfs2, j, u, {nf, ns});
        }
    };

    dfs1(dfs1, 1, -1);
    dfs2(dfs2, 1, -1, {0, 0});
    cout << ans << '\n';

}