#define _CRT_SECURE_NO_DEPRECATE
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <ctime>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <math.h>
#include <stack>
#include <deque>
#include <numeric>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <bitset>

#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ld epsylon = 1e-9;
typedef unsigned int ui;
inline long double get_time(){   
	return (long double)clock()/CLOCKS_PER_SEC;
};

int med[5001];
int n;
map <int, int> m;
map <int, int> br;

int main()
{
	freopen("pooh.in","r",stdin);
	freopen("pooh.out","w",stdout);
	//program
	scanf("%d", &n);
	for (int i = 0; i < n; ++i) 
	{
			scanf("%d",&med[i]);
			m[med[i]]+=med[i];
			br[med[i]]++;
	}
	int mx = -3123;
	int mxi = -3;
	for (map <int, int> ::const_iterator it = m.begin();
		it != m.end(); ++it)
	{
		if (it->second > mx)
		{
			mx = it->second;
			mxi = it->first;
		}
		if (it->second == mx)
		{
			if (br[it->first] < br[mxi])
			{
				mxi = it->first;
			}
		}
	}
	printf("%d\n", mxi);
	//end program
	return 0;
}


<!-- 0.0443s -->