#include <bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> types(n);
    for(int types_i = 0; types_i < n; types_i++){
       cin >> types[types_i];
    }
    std::unordered_map<int,int> Map;
    for (int k=0;k<types.size();k++)
        {
        if (Map.find(types[k])!=Map.end())
            Map[types[k]]++;
        else
            Map[types[k]] = 1;
    }
    int Maxnum = 0;int type=  -1;
    for (const auto &n:Map)
        {
        type = Maxnum < n.second  ? n.first:type;
        Maxnum = max(Maxnum,n.second);
    }
    cout<<type<<endl;
    // your code goes here
    return 0;
}