#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
vector<int> e[N];
long long dp[N],sz[N],dep[N],n,mx,mxid;
void dfs1(int now,int lst)
{
sz[now] = 1;
dep[now] = dep[lst] + 1;
for(int i = 0;i < e[now].size();i++)
{
int next = e[now][i];
if(next == lst)
{
continue;
}
dfs1(next,now);
sz[now] += sz[next];
}
}
void dfs2(int now,int lst)
{
for(int i = 0;i < e[now].size();i++)
{
int next = e[now][i];
if(next == lst)
{
continue;
}
dp[next] = dp[now] - sz[next] +(n - sz[next]);
dfs2(next,now);
}
}
int main()
{
cin >> n;
for(int i = 1;i < n;i++)
{
int u,v;
cin >> u >> v;
e[u].push_back(v);
e[v].push_back(u);
}
dfs1(1,0);
for(int i = 1;i <= n;i++)
{
dp[1] += dep[i];
}
dfs2(1,0);
for(int i = 1;i <= n;i++)
{
if(dp[i] > mx)
{
mx = dp[i];
mxid = i;
}
}
cout << mxid << endl;
}
