#include <bits/stdc++.h>
#include <map>
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> types(n);
    std::map<int, int> countPerType;
     std::map<int, int>::iterator it;
    for(int types_i = 0; types_i < n; types_i++)
    {
        cin >> types[types_i];
        it = countPerType.find(types[types_i]);
        if(it!=countPerType.end())
        {
            it->second++;
        }
        else
        {
            countPerType.insert(std::pair<int, int>(types[types_i], 0));
        }
    }
int max = -1111, maxId = 0;
    for(it  = countPerType.begin(); it != countPerType.end(); it++)
    {
        if(it->second > max) {max = it ->second;maxId = it->first;}
    }
    cout<<maxId;
    // your code goes here
    return 0;
}