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

signed main() {
	int n;
	cin >> n;
	vector<bool> gyereke(n+1, 0);
	vector<vector<int> > adj(n+1);
	for(int i = 1; i < n; i++) {
		int x, y;
		cin >> x >> y;
		adj[x].push_back(y);
		gyereke[y] = 1;
	}
	int os;
	for(int i = 1; i <= n; i++) {
		if (!gyereke[i]) {
			os = i;
			i = n+1;
		}
	}
	queue<int> q;
	vector<int> tav(n+1);
	q.push(os);
	int mxtav = -1, mxind;
	while(!q.empty()) {
		int u = q.front();
		q.pop();
		for(int v : adj[u]) {
			tav[v] = tav[u]+1;
			if (tav[v] > mxtav) {
				mxtav = tav[v];
				mxind = v;
			}
			q.push(v);
		}
	}
	cout << mxind << ' ';



	
	
	return 0;
	
}