from collections import deque

n = int(input())
fw_ind = [[] for _ in range(n)]
bw_ind = [-1] * n
for _ in range(n-1):
    a, f = map(int, input().split())
    bw_ind[f-1] = a-1
    fw_ind[a-1].append(f-1)

dist = [1] * n
q = deque(i for i in range(n) if bw_ind[i] == -1)
while q:
    node = q.popleft()
    for i in fw_ind[node]:
        dist[i] = dist[node] + 1
        q.append(i)

mx, mx_ind = max((dist[i], i+1) for i in range(n))

print(mx_ind)