#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
    ll n;
    cin >> n;
    map<ll,ll> mp;
    for(int i = 0;i < n;i++){
        ll in;
        cin >> in;
        mp[in]++;
    }
    ll mv = 0;
    ll res = 0;
    for(auto i:mp){
        if(i.second >= mv){
            mv = i.second;
            res = i.first;
        }
    }
    cout << res << endl;
}