#include <bits/stdc++.h>
using namespace std;
//using namespace std::chrono;
#define pii pair<int,int>
#define pb push_back
#define vi vector<int>
#define vb vector<bool>
#define vl vector<ll>
#define vvi vector<vi>
#define vvb vector<vb>
#define vvl vector<vl>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define fScan {ios_base::sync_with_stdio(false); cin.tie(NULL);}
#define rep(i, a, b) for(int i = a; i < (b); i++)
#define REP(i, n) for(int i = 0;i <(n); i++)
using ll = long long;
using ld = long double;
ll mod = 1000000007;
const char ny = '\n';
bool prime(ll a) {
if (a==1) return 0;
for (int i=2;i*i<=a;++i)
{
if (a%i==0) return 0;
}
return 1;
}
ll gcd(ll a,ll b) {
if (b==0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b)
{
return a/gcd(a,b)*b;
}
ll min(int a, ll b) {
if(a< b) return a;
else return b;
}
int n;
vector<vector<int>> adj(100005);
int os = 1;
vector<int> be(100005, 0), dist(100005, 0);
void bfs(int kezdo) {
dist[kezdo] = 0;
queue<int> most;
most.push(kezdo);
while(!most.empty()) {
int x = most.front();
most.pop();
for(int i = 0;i< adj[x].size();i++) {
dist[adj[x][i]] = dist[x]+1;
most.push(adj[x][i]);
}
}
}
void solve() {
cin >> n;
for(int i = 0;i< n-1;i++ ){
int a, b;
cin >> a >> b;
be[b]++;
adj[a].push_back(b);
}
for(int i = 1;i<=n;i++ ) {
if(!be[i]) {
os = i;
break;
}
}
bfs(os);
int ma = 0, ans = 1;
for(int i = 1;i<=n;i++ ) {
if(dist[i] > ma) {
ma = dist[i];
ans = i;
}
}
cout << ans << ny;
}
int main()
{
fScan
int t = 1;
//comment out if necessary
//cin>> t;
//auto start = high_resolution_clock::now();
while(t-- ) {
solve();
}
//auto end = high_resolution_clock::now();
//auto dur = duration_cast<milliseconds>(end-start);
//cout<< "runtime: " << dur.count() << " milliseconds" << '\n';
return 0;
}