#include<bits/stdc++.h>
using namespace std;
bool comp(pair<int,int> x,pair<int,int> y){
    if(x.second!=y.second)return x.second<y.second;
    else return x.first<y.first;
}
int main(){
    int n,ans;
    cin>>n;
    vector<pair<int,int>> a;
    for(int i=0;i<n;++i){
        int l;
        cin>>l;
        auto itr=find_if(a.begin(),a.end(),[l](pair<int,int> x){return x.first==l;});
        if(itr==a.end())a.emplace_back(make_pair(l,1));
        else ++itr->second;
    }
    sort(a.begin(),a.end(),comp);
    ans=a.back().first;
    cout<<ans<<endl;
}