#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long int lont;
int main() {
	int N;
	cin >> N;
	vector<int>veca(N+1);
	for (int ia = 0; ia < N; ia++) {
		cin >> veca.at(ia);
	}
	sort(veca.begin(), veca.end());
	reverse(veca.begin(), veca.end());
	int cnta = 1;
	int cntb = 0;
	vector<int>vecb(N);
	for (int ib = 0; ib < N; ib++) {
		if (veca.at(ib) == veca.at(ib + 1)) {
			cnta++;
		}
		else {
			vecb.at(cntb) = cnta;
			cnta = 1;
			cntb++;
		}
	}
	sort(vecb.begin(), vecb.end());
	reverse(vecb.begin(), vecb.end());
	int M = vecb.at(0);
	int cntc = 1;
	for (int id = 0; id < N; id++) {
		if (veca.at(id) == veca.at(id + 1)) {
			cntc++;
		}
		if(veca.at(id)!=veca.at(id+1)) {
			cntc = 1;
		}
		if (cntc == M) {
			cout << veca.at(id) << endl;
			break;
		}
	}
}