#!/usr/bin/python3
#
# Given a sequence of integers <em>A = a<sub>1</sub>, a<sub>2</sub>,
# ... , a<sub>n</sub></em>, a <em>maximal identical sequence</em> is a
# sequence of adjacent identical values <em>v = a<sub>i</sub> =
# a<sub>i+1</sub> = a<sub>i+2</sub> = ... = a<sub>i+k</sub></em> of
# maximal length <em>k</em>.  Write a program that reads an input
# sequence <em>A</em> and outputs the <em>value</em> of the first
# (leftmost) maximal identical sequence in <em>A</em>.
# 
# For example, with this input:
# <pre>
# 8 -2 3 3 4 4 4 2 2 2 3 -2 3 3 3 3 4 4 4 8 2 2 8 2 2 22 2 22 22 2 2 22 8
# </pre>
# 
# the output must be
# 
# <pre>
# 3
# </pre>
#
import sys

A = []
for l in sys.stdin:
    for a in l.split():
        A.append(int(a))

if len(A) > 0:
    v = A[0]
    k = 1
    i = 0
    j = 1
    while j < len(A):
        if A[j] != A[i]:
            i = j
        j = j + 1
        if j - i > k:
            v = A[i]
            k = j - i
            
    print(v)