// UUID: 807e72d0-2f3b-41d3-8e57-38d03c9f4388
//AB
//Feladat linkje: 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector<bool> ose;
vector<vector<int>> gyerekek;
vector<int> szulo;
vector<int> melyseg;
int os;

void bejar(int i) {
    /*if (gyerekek[i].size() == 0) {
        return;
    }*/
    if (i != os) melyseg[i] = melyseg[szulo[i]]+1;
    for (int a : gyerekek[i]) {
        bejar(a);
    }
}


int main() {
    int n;
    cin >> n;
    ose.resize(n+1, true);
    gyerekek.resize(n+1);
    melyseg.resize(n+1, 0);
    szulo.resize(n+1);
    for (int i = 0; i < n-1; i++) {
        int apa, fia;
        cin >> apa >> fia;
        gyerekek[apa].push_back(fia);
        szulo[fia] = apa;
        ose[fia] = false;
    }
    for (int i = 1; i <= n; i++) {
        if(ose[i]) {
            os = i;
            bejar(i);
            break;
        }
    }
    int maxi = 0;
    int maxind = 0;
    for (int i = 1; i <= n; i++) {
        if (melyseg[i] > maxi) {
            maxi = melyseg[i];
            maxind = i;
        }
    }
	cout << maxind <<"\n";
}