#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1LL<<60;
long double pi=3.14159265358979323846L;
double eps=1e-12;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll gya[1000010];
ll kai[1000010];

void nckinit(ll n,ll md){
  kai[0]=1;
  kai[1]=1;
  for(int i=2;i<=n;i++){
    kai[i]=kai[i-1]*i;
    kai[i]%=md;
  }
  gya[n]=gyaku(kai[n],md);
  for(int i=n-1;i>=1;i--){
    gya[i]=gya[i+1]*(i+1);
    gya[i]%=md;
  }
  gya[0]=1;
}
ll nck(ll n,ll k,ll md){
  if(k<0)return 0;
  if(k==0||n==k)return 1;
  ll ret=kai[n];
  ret*=gya[n-k];
  ret%=md;
  ret*=gya[k];
  ret%=md;
  return ret;
}
ll npk(ll n,ll k,ll md){
  if(k<0)return 0;
  if(k==0)return 1;
  ll ret=kai[n];
  ret*=gya[n-k];
  ret%=md;
  return ret;
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n;cin>>n;
    vector<int> v[n+1];
    rep(i,0,n-1){
        int a,b;cin>>a>>b;
        a++;
        b++;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    int ne=-1;
    rep(i,1,n+1){
        if(v[i].size()==1){
            ne=i;
            break;
        }
    }
    int par[n+1];
    v[ne].push_back(0);
    par[ne]=0;
    queue<int> q;
    q.push(ne);
    while(q.size()>0){
        int now=q.front();q.pop();
        rep(i,0,v[now].size()){
            int nee=v[now][i];
            if(par[now]==nee)continue;
            par[nee]=now;
            q.push(nee);
        }
    }
    int dp[n+1];
    fill(dp,dp+n+1,0);
    rep(i,1,n+1){
        if(v[i].size()==1){
            q.push(i);
        }
    }
    int cnt[n+1];
    int d[n+1];
    fill(d,d+n+1,0);
    fill(cnt,cnt+n+1,0);
    while(q.size()>0){
        int now=q.front();q.pop();
        if(v[now].size()>1){
            int sum=0,z=0;
            int dd=0;
            rep(i,0,v[now].size()){
                int nee=v[now][i];
                if(par[now]==nee)continue;
                sum+=dp[nee];
                if(dp[nee]==0)z++;
                if(d[nee]==1)dd=1;
            }
            if(z==0){
                dp[now]=sum;
                if(dd==1&&v[now].size()==2)d[now]=1;
            }
            else if(z==1){
                dp[now]=sum;
                d[now]=1;
            }
            else{
                dp[now]=sum+z-1;
                d[now]=1;
            }
        }
        if(now==ne)break;
        int pp=par[now];
        cnt[pp]++;
        
        if(cnt[pp]==v[pp].size()-1)q.push(pp);
    }
    //rep(i,1,n+1)cout<<d[i]<<" ";
    //cout<<endl;
    if(d[ne]==1)dp[ne]++;
    cout<<dp[ne]<<endl;
}



Measured memory_bytes: 8192