#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <ctime>
#include <map>

#define MAX_BUFF 1024

using namespace std;

#define TR(c,i) for(typeof (c).begin() i = (c).begin(); i != (c).end(); i++) 

vector<int> jars;
map<int,int> jmap;
int N;
long long bestVal;
int bestBur;

void solve()
{
	bestVal = 0;
	for(int i=0;i<N;i++) {
		jmap[jars[i]]++;
	}
    bestBur = 0;
    for(int i=0;i<N;i++) {
        long long tempBest = jars[i]*(long long)jmap[jars[i]];
        if(tempBest>bestVal || (tempBest == bestVal && jars[i]>bestBur)) {
            bestVal = tempBest;
            bestBur = jars[i];
        }
    }
}

void readInput()
{
	FILE* in = fopen("pooh.in", "rt");
	fscanf(in, "%d", &N);
	for (int i = 0; i < N; i++) {
		int temp;
		fscanf(in, "%d", &temp);
		jars.push_back(temp);
	}
	fclose(in);
}

void writeOutput()
{
	FILE* out = fopen("pooh.out", "wt");
	fprintf(out, "%d\n", bestBur);
	fclose(out);
}

int main(void)
{
	readInput();
	solve();
	writeOutput();
	return 0;
}