#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long>v;
for (int i = 0; i < n; i++) {
long long card;
cin >> card;
v.push_back(card);
}
sort(v.begin(), v.end(), less<long long>());
long long cnt = 0;
long long maxcnt = 0;
long long maxnum = LLONG_MIN;
for (int i = 1; i < n; i++) {
//다음수로 넘어가면 업데이트
cnt++;
if (v[i - 1] != v[i]) {
//max cnt와 비교
if (maxcnt < cnt) {
maxcnt = cnt;
maxnum = v[i-1];
cnt = 0;
}
}
}
cout << maxnum;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8Y2xpbWl0cz4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IG47CgljaW4gPj4gbjsKCXZlY3Rvcjxsb25nIGxvbmc+djsKCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJbG9uZyBsb25nIGNhcmQ7CgkJY2luID4+IGNhcmQ7CgkJdi5wdXNoX2JhY2soY2FyZCk7Cgl9Cglzb3J0KHYuYmVnaW4oKSwgdi5lbmQoKSwgbGVzczxsb25nIGxvbmc+KCkpOwoKCWxvbmcgbG9uZyBjbnQgPSAwOwoJbG9uZyBsb25nIG1heGNudCA9IDA7Cglsb25nIGxvbmcgbWF4bnVtID0gTExPTkdfTUlOOwoJZm9yIChpbnQgaSA9IDE7IGkgPCBuOyBpKyspIHsKCQkvL+uLpOydjOyImOuhnCDrhJjslrTqsIDrqbQg7JeF642w7J207Yq4CgkJY250Kys7CgkJaWYgKHZbaSAtIDFdICE9IHZbaV0pIHsKCQkJLy9tYXggY2507JmAIOu5hOq1kAoJCQlpZiAobWF4Y250IDwgY250KSB7CgkJCQltYXhjbnQgPSBjbnQ7CgkJCQltYXhudW0gPSB2W2ktMV07CgkJCQljbnQgPSAwOwoJCQl9CgkJfQoJfQoKCWNvdXQgPDwgbWF4bnVtOwoJcmV0dXJuIDA7Cn0=