#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];
    }
    map<int,int> myMap;
    for(int i = 0; i < types.size(); ++i){
        auto iter = myMap.find(types[i]);
        if(iter != myMap.end()){
            iter->second++;
        }
        else{
            myMap[types[i]] = 1;
        }
    }
    unsigned currentMax = 0;
    unsigned arg_max = 0;
    for(auto it = myMap.cbegin(); it != myMap.cend(); ++it ){
        if (it ->second > currentMax) {
            arg_max = it->first;
            currentMax = it->second;
        }
    }
    cout<<arg_max;
    return 0;
}