#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>

using namespace std;


int main() {
	int i, j, k;
	long n;
	//vector<pair<long,long>>l;
	map<long, long>mp;

	cin >> n;

	for (i = 0; i < n; i++) {
		long num;
		cin >> num;
		//l[num]++;
		if (mp.count(num) == 0) {
			mp.insert(make_pair(num, 1));
		}
		else {
			mp[num]++;
		}
	}

	//sort(l.begin(), l.end(), greater<long>());

	long maxn = 0;

	for (auto itr = mp.begin(); itr != mp.end();itr++) {
		maxn = max((*itr).second, maxn);
	}

	long maxlevel = 0;

	for (auto itr = mp.begin(); itr != mp.end(); itr++) {
		if ((*itr).second >= maxn) {
			maxlevel = max(maxlevel, (*itr).first);
		}
	}
	

	cout << maxlevel << endl;



	getchar();
	getchar();
	return 0;
}