import sys

sys.setrecursionlimit(10**6)

def main2():
  n = int(input())
  connections=[[] for i in range(n+1)] # graph
  con = set() # fiuk

  for i in range(n-1):
    a,b=map(int,input().split())
    connections[a].append(b)
    con.add(b)

  parent = 0
  for f in range(1,n+1):
    if f not in con:
      parent = f
      break

  def deepsearch(node, depth, result, name):
    if result < depth:
        result = depth
        name=node
    for i in connections[node]:
        result,name=deepsearch(i, depth+1, result, name)
    return (result,name)

  print(deepsearch(parent, 0, 0, 0)[1])

def main3():
  n = int(input())
  connections = [[] for i in range(n + 1)]  # graph
  con = [0] * (n + 1)  # fiuk

  for i in range(n - 1):
    a, b = map(int, input().split())
    connections[a].append(b)
    con[b] = 1

  parent = 0
  for f in range(1, n + 1):
    if con[f] == 0:
      parent = f
      break

  start = [parent]
  while start:
    tmp = []
    for v in start:
      for w in connections[v]:
        tmp.append(w)
    if len(tmp) == 0:
      print(start[0])
      break
    start = tmp


main3()