#include<cmath>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define re register int
using namespace std;
int const maxn=1e6+50;
inline int read(){
	int x=0,w=1;
	char ch=getchar();
	while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
	if(ch=='-') w=-1,ch=getchar();
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+ch-48,ch=getchar();
	return x*w;
}
long long sum[maxn],size[maxn],ans[maxn];
int tot=1,dep[maxn],n,h[maxn];
struct data {
    int v,next;
}e[maxn<<1];
inline void add(int u,int v) {
	e[tot].v=v;
	e[tot].next=h[u];
    h[u]=tot++;
}
void dfs(int u,int f){
	sum[u]=dep[u]=dep[f]+1;size[u]=1;
	for(re i=h[u];i;i=e[i].next) {
		int v=e[i].v;
		if(v==f) continue;
		dfs(v,u);
		size[u]+=size[v];
		sum[u]+=sum[v];
	}
}
void DFS(int u,int f) {
	for(re i=h[u];i;i=e[i].next) {
		int v=e[i].v;
		if(v==f) continue;
		ans[v]=ans[u]+n-2*size[v];
		DFS(v,u);
	}
}
int main() {
	n=read();
	for(re i=1,a,b;i<n;++i) {
		a=read(),b=read();
		add(a,b);add(b,a);
	}
	dfs(1,0);
	ans[1]=sum[1];
	DFS(1,0);
	int pos=0;
	for(re i=1;i<=n;++i) {
		if(ans[pos]<ans[i]) pos=i;
	}
	printf("%d\n",pos);
	return 0;
}

/*
8
1 4
5 6
4 5
6 7
6 8
2 4
3 4

*/