#include <string.h>
#include <vector>
#include <queue>
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <algorithm>
#define MAXSIZE 1000010
using namespace std;
int jars[MAXSIZE];

int main()
{
	int N;
	ifstream f_in;
    ofstream f_out;

    f_in.open("pooh.in",ios::in);
    f_out.open("pooh.out",ios::out);

    f_in >> N;
 
	memset(jars, 0, sizeof(jars)/sizeof(int));
	int jarsize;
	for(int i = 0; i <N; i++)
	{
		f_in>>jarsize;
		jars[jarsize]+= jarsize;
	}
	int max = 0;
	int maxsize = 0;
	for(int i = 0; i < MAXSIZE; i++)
	{
		if(max < jars[i])
		{
			max = jars[i];
			maxsize = i;
		}
		if(max == jars[i] && maxsize < i)
		{
			maxsize = i;
		}
	}
	f_out<<maxsize;
	f_out<<endl;
	//return 0;
}<!-- 0.0427s -->