#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long ll;

int n;
ll data[1000010];

int main(){
	scanf("%d",&n);
	for(int i=1; i<=n; ++i) scanf("%lld", data + i);

	sort(data+1, data+n+1);

	int ans_count = 0;
	ll  ans_val = 0;

	for(int i=1; i<=n;){
		int j;
		for(j=i; j<=n && data[i]==data[j]; ++j);
		if(ans_count < j-i){
			ans_count = j-i;
			ans_val = data[i];
		} else if(ans_count == j-i) {
			ans_val = min(ans_val, data[i]);
		}
		i = j;
	}

	printf("%lld\n", ans_val);

	return 0;
}