package main

import (
	"fmt"
	"sort"
)

func resolve(N int, L []int) int {
	ret := L[0]
	tmp := L[0]
	max := 0
	cnt := 1
	for i := 1; i < N; i++ {
		if L[i] == tmp {
			cnt += 1
			continue
		}
		if cnt >= max {
			max = cnt
			ret = tmp
		}
		tmp = L[i]
		cnt = 1
	}
	if cnt >= max {
		return L[N-1]
	}
	return ret
}

func main() {
	var N int
	fmt.Scanf("%d\n", &N)
	L := make([]int, N)
	for i := 0; i < N; i++ {
		fmt.Scanf("%d", &L[i])
	}
	sort.Ints(L)
	fmt.Println(resolve(N, L))
}