#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

#define N 200050

int n,hed[N],cnt;

struct EG

{

    int to,nxt;

}e[*N];

void ae(int f,int t)

{

    e[++cnt].to = t;

    e[cnt].nxt = hed[f];

    hed[f] = cnt;

}

int dp[N][];

void dfs(int u,int fa)

{

    dp[u][]=;

    int mn = 0x3f3f3f3f,y=;

    for(int j=hed[u];j;j=e[j].nxt)

    {

        int to = e[j].to;

        if(to==fa)continue;

        y=;

        dfs(to,u);

        dp[u][]+=min(dp[to][],min(dp[to][],dp[to][]));

        dp[u][]+=min(dp[to][],dp[to][]);

        dp[u][]+=min(dp[to][],dp[to][]);

        if(mn>dp[to][]-dp[to][])mn=dp[to][]-dp[to][];

    }

    if(mn>)dp[u][]+=mn;

    if(y)dp[u][]=0x3f3f3f3f;

}

int main()

{

    scanf("%d",&n);

    for(int f,t,i=;i<n;i++)

    {

        scanf("%d%d",&f,&t);

        ae(f,t),ae(t,f);

    }

    dfs(,);

    int ans = ;

    for(int j=hed[];j;j=e[j].nxt)

    {

        int to = e[j].to;

        ans+=dp[to][]-;

    }

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

    return ;

}