import heapq

right=[]
left=[]
heapq.heapify(right)
heapq.heapify(left)

root=int(input())

for i in range(1,10000001):
  if i%2==1:
    a=int(input())
  else:
    b=int(input())
    if root<min(a,b):
      heapq.heappush(left,-root)
      heapq.heappush(right,a)
      heapq.heappush(right,b)
      root=heapq.heappop(right)
    elif min(a,b)< root < max(a,b):
      heapq.heappush(left,-(min(a,b)))
      heapq.heappush(right,max(a,b))
    else:
      heapq.heappush(right,root)
      heapq.heappush(left,-a)
      heapq.heappush(left,-b)
      root=heapq.heappop(left)*-1
print(root)