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