#include <bits/stdc++.h>

using namespace std;

ifstream fin("darb.in");
ofstream fout("darb.out");

vector<int> v[100005];
int a[100005];
int viz[100005];
int best = 0, bestpoz = 0;
int n;
queue< int > q;
void DFS(int x)
{
    a[x] = 0;
    best = 0;
    bestpoz = 0;
    for(int i = 1; i <= n; i++)
        viz[i] = 0;
    viz[x] = 1;
    q.push(x);
    while(!q.empty())
    {
        x = q.front();
        q.pop();
        for(int i = 0; i < v[x].size(); i++)
        {
            if(!viz[v[x][i]])
            {
                viz[v[x][i]] = 1;
                a[v[x][i]] = a[x] + 1;
                q.push(v[x][i]);
                if(a[v[x][i]] > best)
                    {

                        best = a[v[x][i]];
                        bestpoz = v[x][i];
                    }
            }
        }
    }

}

int main()
{
    int x, y;
    fin >> n;
    for(int i = 1; i <= n - 1; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    DFS(1);
    DFS(bestpoz);
    fout << bestpoz;

    return 0;
}