#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
int arr[10010], brr[100100];
int main() {
	int n;
	cin >> n;
	for (int i = 0;i < n;i++) {
		cin >> arr[i];
		brr[arr[i]]++;
	}
	sort(arr, arr + n);
	int Max = 0, index = 0;
	for (int i = 0;i < n;i++) {
		if (brr[arr[i]] > Max) {
			Max = brr[arr[i]];
			index = i;
		}
	}
	cout << arr[index];
	return 0;
}