// UUID: c2075447-1f98-41d4-a024-d4468d4dd88c
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;

	vector<vector<int>> children(n+1);
	vector<int> parent(n+1);

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

	int gyoker = 1;

	for (int i = 1; i <= n; i++) {
		if (parent[i] == 0) {
			gyoker = i;
			break; 
		}
	}

	queue<pair<int, int>> q;
	q.push({gyoker, 0});
	int legmeszebb = gyoker;
    int max_melyseg = 0;

    while (!q.empty()) {
        auto [u, d] = q.front();
        q.pop();


        if (d > max_melyseg) {
            max_melyseg = d;
            legmeszebb = u;
        }

        for (int v : children[u]) {
            q.push({v, d + 1});
        }
    }

	cout << legmeszebb;



}