#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


template<typename T>
struct edge{
    int from, to;
    T cost;
    int id;

    edge(){}
    edge(int to, T cost=1) : from(-1), to(to), cost(cost){}
    edge(int to, T cost, int id) : from(-1), to(to), cost(cost), id(id){}
    edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id){}
};

template<typename T>
struct redge{
    int from, to;
    T cap, cost;
    int rev;
    
    redge(int to, T cap, T cost=(T)(1)) : from(-1), to(to), cap(cap), cost(cost){}
    redge(int to, T cap, T cost, int rev) : from(-1), to(to), cap(cap), cost(cost), rev(rev){}
};

template<typename T> using Edges = vector<edge<T>>;
template<typename T> using weighted_graph = vector<Edges<T>>;
template<typename T> using tree = vector<Edges<T>>;
using unweighted_graph = vector<vector<int>>;
template<typename T> using residual_graph = vector<vector<redge<T>>>;


void solve(){
    int n; cin >> n;
    tree<int> T(n);
    for(int i=0; i<n-1; i++){
        int u, v; cin >> u >> v;
        u--; v--;
        T[u].pb(edge<int>(v));
        T[v].pb(edge<int>(u));
    }

    vector<vector<int>> dp1(n, vector<int>(2, 0));
    function<void(int, int)> dfs1 = [&](int v, int p){
        for(edge<int> e : T[v]) if(e.to != p){
            dfs1(e.to, v);
        }

        dp1[v][1] = 1;
        for(edge<int> e : T[v]) if(e.to != p){
            dp1[v][0] += dp1[e.to][1];
            dp1[v][1] += dp1[e.to][0];
        }
        dp1[v][1] = max(dp1[v][1], dp1[v][0]);
    }; dfs1(0, -1);

    vector<int> ans(n, 0);
    vector<vector<int>> dp2(n, vector<int>(2, 0));
    function<void(int, int)> dfs2 = [&](int v, int p){
        //calc ans
        {
            for(edge<int> e : T[v]) if(e.to != p) ans[v] += dp1[e.to][0];
            ans[v] += dp2[v][0]+1;
        }

        // calc dp2
        {
            int sum0 = dp2[v][1], sum1 = 1 + dp2[v][0];
            for(edge<int> e : T[v]) if(e.to != p){
                sum0 += dp1[e.to][1];
                sum1 += dp1[e.to][0];
            }
            for(edge<int> e : T[v]) if(e.to != p){
                dp2[e.to][0] = sum0 - dp1[e.to][1];
                dp2[e.to][1] = sum1 - dp1[e.to][0];
                dp2[e.to][1] = max(dp2[e.to][1], dp2[e.to][0]);
            }
        }

        for(edge<int> e : T[v]) if(e.to != p){
            dfs2(e.to, v);
        }
    }; dfs2(0, -1);


    int res = IINF;
    for(int v=0; v<n; v++) res = min(res, ans[v]);
    cout << res << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}