#include <bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin >> n;
    if(n==0) return 0;
    vector<int> types(n);
    for(int types_i = 0; types_i < n; types_i++){
       cin >> types[types_i];
    }
    // your code goes here
    unordered_map<int,int> mymap;
    for(int i=0;i<types.size();i++){
        mymap[types[i]] +=1;
    }
    
    unordered_map<int,int>::iterator it ;
    
    int maxi = INT_MAX;int value = INT_MIN;
    for(it = mymap.begin() ; it!= mymap.end(); ++it){
        if(it->second == value){
            maxi = min(maxi,it->first);
        }
         else if(it->second > value){
            value = it->second;
            maxi= it->first;
        }
    }
    cout<<maxi;
    
    return 0;
}