#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    int n; cin >> n;
    vvi adj(n);
    rep(i, n-1){
        int u, v; cin >> u >> v;
        u--; v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    vi pa(n, -1), tmp(n, 0); vvi child(n);
    queue<int> q; q.push(0); pa[0] = 0;
    while(!q.empty()){
        auto u = q.front(); q.pop();
        for(auto v : adj[u]){
            if(pa[v] == -1){
                pa[v] = u;
                child[u].push_back(v);
                tmp[u]++;
                q.push(v);
            }
        }
    }

    vvi dp(n, vi(2, 0));//0 white 1 black
    vi mx(n, 0);
    rep(i, n){
        dp[i][1] = 1;
        if(tmp[i] == 0){
            q.push(i);            
            mx[i] = 1;
        }
    }

    while(!q.empty()){
        auto u = q.front(); q.pop();
        int p = pa[u];
        dp[p][0] += mx[u];
        dp[p][1] += dp[u][0];
        tmp[p]--;
        if(tmp[p] == 0){
            mx[p] = max(dp[p][0], dp[p][1]);
            if(p != 0)q.push(p);
        }
    }
    vvi up(n, vi(2,0));
    int ans = 1; for(auto i : child[0]){
        ans += dp[i][0]; q.push(i);
    }

    while(!q.empty()){
        auto u = q.front(); q.pop();
        int p = pa[u];
        up[u][0] = max(up[p][0], up[p][1]) + dp[p][0] - mx[u];
        up[u][1] = up[p][0] + dp[p][1] - dp[u][0];
        ans = min(ans, dp[u][1] + up[u][0]);
        for(auto v : child[u])q.push(v);
    }cout << ans << endl;

    return 0;
}