#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <cmath>
#include <climits>

using namespace std;

#define mp(first, second) make_pair(first, second)

typedef unsigned long long ul;
typedef long long ll; 
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;

int main()
{
	cin.tie(nullptr);

	int n;
	cin >> n;
	vector<int> types(n);
	for (int types_i = 0; types_i < n; types_i++) {
		cin >> types[types_i];
	}

	map<int, int> counters;
	for (int i = 0; i < types.size(); i++) {
		counters[types[i]]++;
	}

	ii ans;
	ans.first = 0;
	ans.second = 0;

	for(map<int, int>::iterator it = counters.begin(); it != counters.end(); ++it)
	{
		if (it->second > ans.second)
		{
			ans.first = it->first;
			ans.second = it->second;
		}
		if (it->second == ans.second)
		{
			ans.first = it->first < ans.first ? it->first : ans.first;
		}
	}

	cout << ans.first << endl;

	//while (true)
	//{
	//	
	//}

	return 0;
}