#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
const int N=int(2e5)+10;
set<int>g[N];
bool del[N];
int n;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q;
int main()
{
    scanf("%d",&n);
    rep(i,n-1)
    {
        int x,y;scanf("%d%d",&x,&y);
        g[x].insert(y);g[y].insert(x);
    }
    rep(i,n)if(g[i].size()==1)q.push(mp(g[*g[i].begin()].size(),i));
    int ans=0;
    bool flag=0;
    for(;!q.empty();)
    {
        int u=q.top().second;q.pop();
        if(del[u])continue;
        del[u]=1;
        int x=*g[u].begin();
        if(g[x].size()<=2)
        {
            del[x]=1;
            ans++;
            for(auto y:g[x])
            {
                if(y==u)continue;
                g[y].erase(x);
                if(g[y].size()==0){ans+=2;flag=1;break;}
                if(g[y].size()==1)q.push(mp(g[*g[y].begin()].size(),y));
                if(g[y].size()==2)
                {
                    for(auto t:g[y])if(g[t].size()==1)q.push(mp(g[y].size(),t));
                }
            }
            if(flag)break;
        }
        else
        {
            g[x].erase(u);
            ans+=2;
            if(g[x].size()==1)q.push(mp(g[*g[x].begin()].size(),x));
            if(g[x].size()==2)for(auto y:g[x])if(g[y].size()==1)q.push(mp(1,y));
        }
    }
    printf("%d\n",ans);
    return 0;
}