#include <set>

 #include <queue>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 #define N 200010

 #define ll long long

 using namespace std;

 //re

 int gint()

 {

     int ret=,fh=;char c=getchar();

     while(c<''||c>''){if(c=='-')fh=-;c=getchar();}

     while(c>=''&c<=''){ret=ret*+c-'';c=getchar();}

     return ret*fh;

 }

 int n,m,K,ma,cte,num;

 int head[N],vis[N],use[N],dis[N],fa[N];

 struct Edge{int to,nxt,val;}edge[N*];

 void ae(int u,int v){

     cte++;edge[cte].to=v;

     edge[cte].nxt=head[u],head[u]=cte;}

 struct node{

     int id,d;

     friend bool operator<(const node &s1,const node &s2)

     {return s1.d<s2.d;}

     node(int id,int d):id(id),d(d){} node(){}

 };

 void bfs()

 {

     queue<int>q;q.push();

     while(!q.empty())

     {

         int u=q.front();q.pop();

         for(int j=head[u];j;j=edge[j].nxt){

             int v=edge[j].to;

             if(v==fa[u]) continue;

             fa[v]=u,dis[v]=dis[u]+;

             q.push(v);

         }

     }

 }

 int solve()

 {

     priority_queue<node>q;

     for(int i=;i<=n;i++)

         if(dis[i]>) q.push(node(i,dis[i]));

     int ans=;

     while(!q.empty())

     {

         node k=q.top();q.pop();

         int x=k.id,y=fa[x];

         if(vis[x]) continue; vis[x]=;

         dis[y]=,vis[y]=,ans++;

         for(int j=head[y];j;j=edge[j].nxt){

             int v=edge[j].to;

             dis[v]=min(dis[v],),vis[v]=;

             q.push(node(v,dis[v]));

         }

     }return ans;

 }

 int main()

 {

     scanf("%d",&n);

     int x,y,z,fx;

     for(int i=;i<n;i++)

         x=gint(),y=gint(),ae(x,y),ae(y,x);

     bfs();

     printf("%d\n",solve());

     return ;

 }