#include<bits/stdc++.h>
#define N 300005
#define re 
using namespace std;
int n,m,K,q,T;
inline void Rd(int &res){
	re char c;res=0;
	while(c=getchar(),c<48);
	do res=(res<<3)+(res<<1)+(c^48);
	while(c=getchar(),c>47);
}
int head[N],to[N<<1],nxt[N<<1],cnt1;
inline void adde(int x,int y){to[++cnt1]=y;nxt[cnt1]=head[x];head[x]=cnt1;}

int a[N], ans = 0;
int Lson[N], Rson[N];

void dfs(int x,int f){
	int cnt = 0;
	for(re int i=head[x];i;i=nxt[i]){
		int y=to[i];
		if(y==f)continue;
		if(Lson[x]==0)Lson[x]=y;
		else Rson[x]=y;
		cnt++;
		dfs(y,x);
	}
	if (cnt == 0) a[x] = 0;
	else if (cnt == 1) a[x] = 1;
	else a[x] = min(a[Lson[x]] + 1, a[Rson[x]] + 1) + 1;
	// printf("%d %d\n", x, a[x]);
}

void dfs2(int x, int f) {
	if (f > 0) {
		if (a[f] <= 0) ans += 1;
		a[x] = min(a[x], a[f] - 1);
	}
	// printf("? %d %d\n", x, a[x]);
	for(re int i=head[x];i;i=nxt[i]){
		int y=to[i];
		if(y==f)continue;
		dfs2(y,x);
	}
}

int main(){
	Rd(n);
	for(re int i=1;i<n;i++){
		int x,y;
		Rd(x),Rd(y);
		adde(x,y);
		adde(y,x);
	}
	a[0] = 0;
	dfs(1,0);
	dfs2(1, 0);
	printf("%d\n",ans);
	
	
	
	return 0;
}