#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),i##z=(b);i<=i##z;i++)
using namespace std;
const int N=int(2e5)+10;

vector<int> c[N]; vector<int> lst[N]; int dis[N],n;

void addE(int u,int v){ c[u].push_back(v),c[v].push_back(u); }

void dfs(int p,int fa=0){
	dis[p]=dis[fa]+1,lst[dis[p]].push_back(p);
	for(int v:c[p]) if(!dis[v]) dfs(v,p);
}
int gsize(int p){ return c[p].size()+(p==1)-1; }
int dfs2(int p,int rest){
	if(rest<0) return 0;
	int cnt=1;
	for(int v:c[p]) if(dis[v]>dis[p]) cnt+=dfs2(v,rest-1);
	return cnt;
}

int main(){
	cin>>n; for(int i=1,u,v;i<n;i++) cin>>u>>v,addE(u,v); dfs(1);
	int lp=0,ans=0,cnt[3]; memset(cnt,0,sizeof(cnt));
	FOR(i,1,n) if(lst[i].size() == (1<<(i-1))) lp=max(lp,i);
	ans=(1<<lp)-1;
	for(int p:lst[lp]) cnt[gsize(p)]++;
	if(cnt[0])
		for(int p:lst[lp])
			ans+=dfs2(p,min(1,gsize(p)))-1;
	else
		for(int p:lst[lp])
			ans+=dfs2(p,gsize(p))-1;
	cout<<n-ans;
	return 0;
}