#include <bits/stdc++.h>
#define MULTI int _; cin >> _; while(_--)
#define fi first
#define se second
#define pb(a) push_back(a)
#define rep(i, n) for(int i = 0; i < n; i++)
#define reps(i, n, m) for(int i = n; i <= m; i++)
#define repsv(i, n, m) for(int i = n; i >= m; i--)
#define vsz(a) (int)(a.size())
#define mp(a, b) make_pair(a, b)
#define all(a) a.begin(), a.end()

using namespace std;

typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;

#ifdef LOCAL
#include "debugs.hpp"
#else
#define dbg(...) 0
#endif

vector<vi> to;

int dfs(int i, int p, bool m){
    map<int, int> dp[2];
    for(int j : to[i]){
        if(j == p) continue;
        dp[0][j] = dfs(j, i, 0);
        dp[1][j] = dfs(j, i, 1);
    }
    int res = 0;
    for(int j : to[i])
        if(j!=p)
            res += dp[0][j];
    if(m)
        return res;
    int ans = 0;
    for(int j : to[i])
        if(j != p)
            ans = max(ans, res-dp[0][j]+dp[1][j]+1);
    return ans;
}

void solve(){
    int n;
    cin >> n;
    to = vector<vi>(n);
    rep(i, n-1){
        int v, w;
        cin >> v >> w;
        v--;w--;
        to[v].pb(w);
        to[w].pb(v);
    }
    int m;
    rep(i, n)
        if(vsz(to[i])==1){
            m = dfs(i, -1, 0);
            break;
        }
    dbg(m);
    cout << 2*n-3*m << '\n';
}

int main(){
    ios_base::sync_with_stdio(false);
    // MULTI
    solve();
}