#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T=int> inline T in() { T x; cin >> x; return x; }

int main() {
    int n; cin >> n;
    vector<int> cnt(n + 1);
    for (int i = 0; i < n; i++) cnt[in()]++;
    int ma = *max_element(begin(cnt), end(cnt));
    int p = n;
    while (cnt[p] != ma) p--;
    cout << p << endl;
    return 0;
}