// UUID: 7c7d4183-dd7d-49fd-a980-02a351b87367
#include <bits/stdc++.h>
using namespace std;

vector<int> melyseg;
vector<vector<int>> fa;
vector<int> szulo;

void bejaras(int x){
    melyseg[x] = melyseg[szulo[x]]+1;
    for(int i = 0; i < fa[x].size(); i++){
        bejaras(fa[x][i]);
    }
}

int main() {
	int n; cin >> n;
    fa.resize(n+1);
    melyseg.resize(n+1);
    szulo.resize(n+1);
    vector<bool> osok(n+1, true);
    for(int i = 0; i < n-1; i++){
        int x, y; cin >> x >> y;
        fa[x].push_back(y);
        szulo[y] = x;
        osok[y] = false;
    }
    int os = 0;
    for(int i = 1; i < n+1; i++) if(osok[i]){
        os = i;
        break;
    }
    bejaras(os);
    int sol = 0;
    int soli;
    for(int i = 1; i < n+1; i++){
        if(sol < melyseg[i]){
            sol = melyseg[i];
            soli = i;
        }
    }
    cout << soli;
}