#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> m;
    for(int i = 0;i < n;i++)
    {
        if (m.find(types[i]) == m.end())
            m.insert(pair<int, int>(types[i], 1));
        else
            m[types[i]]++;
    }
    
    map<int, int>::iterator it;
    pair<int, int> p(0,0);
    
    for(it = m.begin();it != m.end();it++)
    {
        if (it->second > p.second)
        {
            p.first = it->first;
            p.second = it->second;
        }
        else if (it->second == p.second && p.first > it->first)
        {
            p.first = it->first;
            p.second = it->second;
        }
    }
    cout<<p.first;
    // your code goes here
    return 0;
}