#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

using namespace std;

#define maxn 1000005

int n,tot;

int now[maxn],pre[*maxn],son[*maxn],dep[maxn],size[maxn];

long long dp[maxn];

int read(){

    int x=;char ch=getchar();

    for (;ch<''||ch>'';ch=getchar());

    for (;ch>=''&&ch<='';ch=getchar()) x=x*+ch-'';

    return x;

}

void add(int a,int b){

    son[++tot]=b;

    pre[tot]=now[a];

    now[a]=tot;

}

void link(int a,int b){

    add(a,b),add(b,a);

}

void dfs(int x,int fa){

    dep[x]=dep[fa]+,dp[x]=dep[x],size[x]=;

    for (int p=now[x];p;p=pre[p])

        if (son[p]!=fa){

            dfs(son[p],x);

            dp[x]+=dp[son[p]];

            size[x]+=size[son[p]];

        }

}

void tree_dp(int x,int fa){

    for (int p=now[x];p;p=pre[p])

        if (son[p]!=fa){

            dp[son[p]]=dp[x]+n-*size[son[p]];

            tree_dp(son[p],x);

        }

}

int main(){

    n=read();

    for (int i=,a,b;i<n;i++) a=read(),b=read(),link(a,b);

    dfs(,),tree_dp(,);int ans=;

    for (int i=;i<=n;i++) if (dp[ans]<dp[i]) ans=i;

    printf("%d\n",ans);

    return ;

}