#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e6+5,inf=0x3f3f3f3f;
int n,dep[M],dp[M][2];
vector<int>adj[M];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
void dfs(int x,int f){
    dep[x]=dep[f]^1;
    bool leaf=1;int cur=0;
    for (auto y:adj[x]){
        if (y==f) continue; leaf=0; dfs(y,x);
        dp[x][0]=min(dp[x][0]+dp[y][0],inf);
        dp[x][1]=min(dp[x][1]+dp[y][1],inf);
        cur+=min(dp[y][dep[x]],dp[y][!dep[x]]+1);
    }
    if (leaf) dp[x][dep[x]]=0,dp[x][!dep[x]]=inf;
    else dp[x][dep[x]]=min(dp[x][dep[x]],cur);
}
int main(){ n=read();
    for (int i=1;i<n;i++){
        int x=read(),y=read();
        adj[x].emplace_back(y);
        adj[y].emplace_back(x);
    } dep[0]=1;
    for (int i=1;i<=n;i++)
        if (adj[i].size()==1){
            dfs(i,0);
            printf("%d\n",dp[i][0]);
            exit(0);
        }
    return 0;
}