#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
vector <int> v[100001];
queue <int> q;
bool viz[100001];
int last,ad[100001];
int bfs(int start)
{
    int x;
    q.push(start);
    ad[start]=1;
    viz[start]=1;
    while(!q.empty())
    {
        x=q.front();
        for(int i=1;i<=v[x][0];i++)
            if(!viz[v[x][i]])
            {
                ad[v[x][i]]=ad[x]+1;
                viz[v[x][i]]=1;
                q.push(v[x][i]);
                last=v[x][i];
            }
        q.pop();
    }
}
int main()
{
    freopen("darb.in","r",stdin);
    freopen("darb.out","w",stdout);

    int a,b,n;
    scanf("%d",&n);

    for(int i=1;i<=n;i++) v[i].push_back(0);

    while(scanf("%d%d",&a,&b)!=EOF)
    {
        v[a][0]++;v[b][0]++;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    bfs(1);
    for(int i=1;i<=n;i++) ad[i]=viz[i]=0;
    bfs(last);
    int max=0,sol=0;
    for(int i=1;i<=n;i++)
        if(ad[i]>max)
        {
            max=ad[i];
            sol=i;
        }
    printf("%d",sol);


    return 0;
}