#include <bits/stdc++.h>

using namespace std;


vector<vector<int>> v;
vector<int> d;

void dfs(int x, int a){
    if (d[x] != -1) return;
    d[x] = a + 1;
    for (int i : v[x]){
        dfs(i, d[x]);
    }
}

int main(){

    int n; cin >> n;
    v.assign(n+1, {});
    d.assign(n+1, -1);

    vector<bool> dad(n+1, false);

    for (int i = 0; i < n-1; i++){
        int a, b; cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
        dad[b] = true;
    }

    int grand = 0;

    for (int i = 1; i <= n; i++){
        if (!dad[i]){
            grand = i;
            break;
        }
    }


    dfs(grand, -1);

    int m = 0, mi = 0;

    for (int i = 1; i <= n; i++){
        if (d[i] > m){
            m = d[i];
            mi = i;
        }
    }

    cout << mi;

    return 0;
}