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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<vector<int>> g(n);
    for(int i = 1; i < n; i++){
        int u, v;
        cin >> u >> v;
        g[--u].push_back(--v);
        g[v].push_back(u);
    }
    auto bfs = [&](int from){
        queue<int> nxt;
        vector<int> dist(n, 1 << 30);
        dist[from] = 0;
        nxt.push(from);
        while(!nxt.empty()){
            int v = nxt.front();
            nxt.pop();
            for(auto &u : g[v]){
                if(dist[v] + 1 >= dist[u]) continue;
                dist[u] = dist[v] + 1;
                nxt.push(u);
            }
        }
        return dist;
    };
    auto dist = bfs(0);
    int root = max_element(dist.begin(), dist.end()) - dist.begin();
    vector<ll> dp(n), dp2(n);
    function<void(int, int)> dfs = [&](int v, int p){
        ll s = 0, mx = 0;
        for(auto &u : g[v]){
            if(u == p) continue;
            dfs(u, v);
            dp[u] += 2;
            dp2[u]++;
            mx = max(mx, dp[u] - dp2[u]);
            s += dp[u];
        }
        dp[v] = s;
        dp2[v] = s - mx;
    };
    dfs(root, -1);
    cout << dp2[root] << '\n';
}