#include<bits/stdc++.h>
#define MAXN 200000
using namespace std;
template<typename T>
inline void read( T &n )
{
	n=0;bool w=false;char ch=getchar();
	while( ch>'9' || ch<'0' ) w=!(ch^'-'),ch=getchar();
	while( ch<='9' && ch>='0' ) n=(n<<3)+(n<<1)+(ch^48),ch=getchar();
	n=w?-n:n;
}

int n,ans;
struct Edge
{
	int to,nxt;
}edg[MAXN+5];
int head[MAXN+5],edg_num;
void add( int u , int v )
{
	++edg_num;
	edg[edg_num].to=v;
	edg[edg_num].nxt=head[u];
	head[u]=edg_num;
}

int lson[MAXN+5],rson[MAXN+5],depth[MAXN+5],size[MAXN+5];
void dfs( int u , int fa=0 )
{
	depth[u]=size[u]=1;
	for(int i=head[u];i;i=edg[i].nxt)
	{
		int v=edg[i].to;
		if( v==fa ) continue;
		if( !lson[u] ) lson[u]=v;
		else rson[u]=v;
		dfs(v,u);
		depth[u]=max(depth[lson[u]],depth[rson[u]])+1;
		size[u]=size[lson[u]]+size[rson[u]]+1;
	}
}
void rub( int u , int d )
{
	if( !u ) return;
	if( d==0 ) 
	{
		ans-=size[lson[u]]+size[rson[u]];
		lson[u]=rson[u]=0;
		depth[u]=size[u]=1;
		return;
	}
	rub(lson[u],d-1);
	rub(rson[u],d-1);
	size[u]=size[lson[u]]+size[rson[u]]+1;
	depth[u]=max(depth[lson[u]],depth[rson[u]])+1;
}
void solve( int u )
{
	if( !u ) return;
	solve(lson[u]);
	solve(rson[u]);
	if( depth[lson[u]]>depth[rson[u]] ) swap(lson[u],rson[u]);
	if( depth[rson[u]]-depth[lson[u]]>1 )
		rub(rson[u],depth[lson[u]]);
	depth[u]=max(depth[lson[u]],depth[rson[u]])+1;
	size[u]=size[lson[u]]+size[rson[u]]+1;
}

int main()
{
	read(n);
	ans=n;
	for(int i=1;i<n;i++)
	{
		int a,b;
		read(a),read(b);
		add(a,b),add(b,a);
	}
	dfs(1);
	solve(1);
	printf("%d",n-ans);
	return 0;
 }