#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353; //1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int main(){
  int n;cin>>n; vc v(n,vc<int>(0));
  rep(i,n-1){
    int a,b;cin>>a>>b; a--;b--;
    v[a].pb(b);v[b].pb(a);
  }
  vc<pp>dp(n);
  auto f=[&](auto f,int a,int p)->pp{
    pp res={0,1};
    for(auto au:v[a])if(au!=p){
      auto [x,y]=f(f,au,a);
      res.fi+=max(x,y);
      res.se+=x;
    }
    return dp[a]=res;
  };
  f(f,0,-1);
  int ans=n;
  auto ff=[&](auto ff,int a,int p,pp now)->void{
    ans=min(ans,now.se);
    for(auto au:v[a])if(au!=p){
      int da=now.fi-max(dp[au].fi,dp[au].se);
      int db=now.se-dp[au].fi;
      int x=dp[au].fi+max(da,db);
      int y=dp[au].se+da;
      ff(ff,au,a,{x,y});
    }
    return;
  };
  ff(ff,0,-1,dp[0]);
  cout<<ans;
}