#include <iostream>
#include <fstream>

using namespace std;

ifstream finput;
int N;
int elem[5000];
int maxElem = 0;
int bType = 0;

void read()
{
	do
	{
		finput >> N;
	}
	while ((N < 1) || (N > 5000));

	for (int i = 0; i < N; i++)
	{
		finput >> elem[i];
		if (elem[i] > maxElem)
		{
			maxElem = elem[i];
		}
	}
}

void input()
{
	finput.open("pooh.in");
	read();
	finput.close();
}

void algorithm()
{
	int bMax = 0;
	for (int i = 0; i <= maxElem; i++)
	{
		int counter = 0;
		for (int j = 0; j < N; j++)
		{
			if (i == elem[j])
			{
				counter++;
			}
		}
		if (counter * i >= bMax)
		{
			bMax = counter * i;
			bType = i;
		}
	}
}

void output()
{
	ofstream foutput;
	foutput.open("pooh.out");
	foutput << bType << endl;
	foutput.close();
}

int main()
{
	input();
	algorithm();
	output();
	return 0;
}