#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, ans;
int anscount = 1;
int count = 1;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
sort(a.begin(), a.end());
ans = a[0];
for (int i = 1; i < n; i++) {
if (ans == a[i]) {
anscount++;
}
if (a[i] != a[i - 1]) {
count = 1;
}
if (a[i] == a[i - 1] && ans!=a[i]) {
count++;
}
if (count > anscount) {
anscount = count;
count = 1;
ans = a[i];
}
}
cout << ans;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgbiwgYW5zOwoJaW50IGFuc2NvdW50ID0gMTsKCWludCBjb3VudCA9IDE7CgljaW4gPj4gbjsKCXZlY3Rvcjxsb25nIGxvbmc+IGEobik7CgkKCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJc2NhbmYoIiVsbGQiLCAmYVtpXSk7Cgl9CgoJc29ydChhLmJlZ2luKCksIGEuZW5kKCkpOwoKCWFucyA9IGFbMF07CgoJZm9yIChpbnQgaSA9IDE7IGkgPCBuOyBpKyspIHsKCgkJaWYgKGFucyA9PSBhW2ldKSB7CgkJCWFuc2NvdW50Kys7CgkJfQoKCQlpZiAoYVtpXSAhPSBhW2kgLSAxXSkgewoJCQljb3VudCA9IDE7CgkJfQoKCQlpZiAoYVtpXSA9PSBhW2kgLSAxXSAmJiBhbnMhPWFbaV0pIHsKCQkJY291bnQrKzsKCQl9CgoJCWlmIChjb3VudCA+IGFuc2NvdW50KSB7CgkJCWFuc2NvdW50ID0gY291bnQ7CgkJCWNvdW50ID0gMTsKCQkJYW5zID0gYVtpXTsKCQl9Cgl9CgoJY291dCA8PCBhbnM7CgoJcmV0dXJuIDA7Cn0K