#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	int n;
	cin >> n;
	vector<int> L(n);

	for (int i = 0; i < n; i++)
	{
		cin >> L[i];
	}
	sort(L.begin(), L.end());

	int key;
	int val = 0;
	int valMax = 0;
	for (int i = 0; i < n; i++)
	{
		val++;
		if (i == n - 1 || L[i] != L[i + 1])
		{
			if (val >= valMax)
			{
				key = L[i];
				valMax = val;
			}
			val = 0;
		}
	}
	cout << key << endl;
}