#include <stdio.h>
#include <algorithm>
#include <deque>
using namespace std;
using ll = long long;

//79
int main() {
	int n, L[100000];
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%d", L + i);
	sort(L, L + n);

	int carry = 1, mcarry = 1, res = L[0];
	for (int i = 1; i < n; i++) {
		if (L[i] != L[i - 1]) {
			carry = 1;
		} else {
			carry++;
		}
		mcarry = max(mcarry, carry);
		if (mcarry == carry)
			res = L[i];
	}
	printf("%d\n", res);
}