// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, a, b, maxi=0, hol;
    cin>>n; 
    vector<vector<int>> graf(n);
    vector<bool> been(n, true);
    queue<int> q;
    vector<int> erdo(n, -1);
    for(int i=0; i<n-1; i++){
        cin>>a>>b;
        a--;
        b--;
        graf[a].push_back(b);
        been[b]=false;
    }
    for(int i=0; i<n; i++){
        if(been[i]){
            q.push(i);
            erdo[i]=0;
        }
    }
    while(!q.empty()){
        for(auto x:graf[q.front()]){
            if(erdo[x]==-1){
                q.push(x);
                erdo[x]=erdo[q.front()]+1;
                if(erdo[x]>maxi){
                    maxi=erdo[x];
                    hol=x;
                }
            }
        }
        q.pop();
    }
    cout<<hol+1;
}