#include<cstdio>
#include<algorithm>
using namespace std;
inline int in(){
	int x=0,f=1;char c;
	c=getchar();
	while (c<'0'||c>'9'){
		if (c=='-')f=-1;
		c=getchar();
	}
	while (c>='0'&&c<='9'){x=(x<<3)+(x<<1)+(c^48);c=getchar();}
	return x*f;
}
int n,id,head[1000005],dp[1000005],f[1000005],size[1000005],ans,cnt;
struct node{int to,net;}w[2000005];
inline void add(int u,int v){
	w[++id].net=head[u];
	w[id].to=v;
	head[u]=id;
}
inline void dfs1(int x,int from){
	size[x]=1;f[x]=f[from]+1;
	for(int i=head[x];i;i=w[i].net){
		int y=w[i].to;
		if(y==from) continue;
		dfs1(y,x);
		size[x]+=size[y];
	}
}
inline void dfs2(int x,int from){
	for(int i=head[x];i;i=w[i].net){
		int y=w[i].to;
		if(y==from) continue;
		dp[y]=dp[x]+n-2*size[y];
		dfs2(y,x);
	}
}
int main(){
	n=in();
	for (int i=1;i<n;i++){
		int u=in(),v=in();
		add(u,v);add(v,u);
	}
	dfs1(1,0);
	for(int i=1;i<=n;i++) dp[1]+=f[i];
	dfs2(1,0);
	for(int i=1;i<=n;i++) if(ans<dp[i]) ans=dp[i],cnt=i;
	printf ("%d",cnt);
	return 0;
}