#include <iostream>
#include <queue>
#define ll long long

using namespace std;

struct adat
{
    ll ido, ut;
    bool lat = false;
    vector <ll> sz;
};
vector <adat> x;

void melyseg(ll csp)
{
    x[csp].lat = true;
    for (auto& e : x[csp].sz)
    {
        x[e].ido += 1 + x[csp].ido;
        if (!x[e].lat)
        {
            melyseg(e);
        }
    }
}

int main()
{
    ll n;
    cin >> n;
    x.resize(n + 1);
    for (ll i = 1; i <= n-1; ++i)
    {
        ll cs1, cs2;
        cin >> cs1 >> cs2;
        x[cs1].sz.push_back(cs2);
        x[cs2].ut = cs1;
    }
    for (ll i = 1; i <= n; ++i)
    {
        if (!x[i].ut)
        {
            melyseg(i);
            break;
        }
    }
    ll maxpoz = -1, maxi = -9999999;
    for (ll i = 1; i <= n; ++i)
    {
        if (x[i].ido > maxi)
        {
            maxi = x[i].ido;
            maxpoz = i;
        }
    }
    cout << maxpoz;

    return 0;
}
/*
8
1 4
5 7
8 6
8 5
3 1
3 2
3 8
*/