#include <bits/stdc++.h>

using namespace std;

int main()
{
    iostream::sync_with_stdio(0);
    cin.tie(0);
    int len;
    cin >> len;

    vector<vector<int>> fia (len+1,vector<int>());
    vector<int> apja(len+1,-1);

    int t1,t2;

    for(int i = 0; i < len-1; i++)
    {
       cin >> t1 >>t2;

       fia[t1].push_back(t2);
       apja[t2] = t1;

    }

    vector<int> vegek;

    vector<int> veglen(len+1,-1);


    for(int i = 1; i < len; i++)
    {
        if(fia[i].capacity() == 0)
        {
            vegek.push_back(i);
        }
    }

    int k;
    int num = 0;

    for(int x : vegek)
    {
        k = x;
        while(apja[k] != -1)
        {
            k = apja[k];
            veglen[x]++;
        }
    }

    int maxi = 0;
    int index;

    for(int x : vegek)
    {
        if(maxi < veglen[x])
        {
            maxi = veglen[x];
            index = x;
        }
    }

    cout << index;
}