#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a >= b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
ll n;
vvl g(200010);
vvl dp(200010,vl(2));
void dfs(ll v,ll par=-1){
    for(auto p:g[v]){
        if(p==par)continue;
        dfs(p,v);
        dp[v][0]+=max(dp[p][0],dp[p][1]);
        dp[v][1]+=dp[p][0];
    }
    dp[v][1]+=1;
}
vvl ndp(200010,vl(2));
void bfs(ll v,ll par=-1){
    ndp[v][0]=dp[v][0];
    ndp[v][1]=dp[v][1];
    if(par!=-1){
        ndp[v][0]+=max(ndp[par][0]-max(dp[v][0],dp[v][1]),ndp[par][1]-dp[v][0]);
        ndp[v][1]+=ndp[par][0]-max(dp[v][0],dp[v][1]);
    }
    for(auto p:g[v]){
        if(p==par)continue;
        bfs(p,v);
    }
}

int main(){
    cin >> n;
    rep(i,n-1){
        ll a,b;cin >> a >> b;a--;b--;
        g[a].emplace_back(b);
        g[b].emplace_back(a);
    }
    dfs(0);
    bfs(0);
    //rep(i,n)cout << ndp[i][0] <<" " << ndp[i][1] << endl;
    ll ans=INF;
    rep(i,n)chmin(ans,ndp[i][1]);
    cout << ans << endl;

}