#include <bits/stdc++.h>
#include <unordered_map>
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];
    }
    // your code goes here
    sort(types.begin(),types.end());
    int freq=types[0];
    int count = 1;
    int count_max = 1;
    for(int i = 0; i<n; i++){
        if(types[i]==types[i+1])
            count++;
        else
            count = 1;
        if(count>count_max){
            count_max=count;
            freq = types[i];
        }
    }
    cout << freq <<"\n";
    return 0;
}