// UUID: dddc703b-5b45-45c7-a123-4b1fbf2727c2
#include <bits/stdc++.h>
#include <vector>
using namespace std;

vector<vector<int>> g;
vector<int> dist;
vector<bool> vis;

int legn = 0;
int melyik = 0;

void dfs(int v) {
	vis[v] = true;
	for (int i : g[v]) {
		if (vis[i] == false) {
			dist[i] = dist[v] + 1;
			if (dist[i] > legn) {
				legn = dist[i];
				melyik = i;
			}
			dfs(i);
		}
	}
}

int main() {
	int n;
	cin >> n;
	g.resize(n);
	dist.resize(n);
	vis.resize(n);

	int a, b;
	vector<bool> apae (n, false);
	for (int i = 0; i < n - 1; i++) {
		cin >> a >> b;
		g[a - 1].push_back(b - 1);
		apae[b - 1] = true;
	}
	
	int gyoker = 0;
	for (int i = 0; i < n; i++) {
		if (apae[i] == false) {
			gyoker = i;
		}
	} 

	dfs(gyoker);
	cout << melyik + 1;
}