#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;

int main() {
    int n;
    cin >> n;
    unordered_map<int,int> umap;
    while (n--) {
        int now;
        cin >> now;
        const auto& ptr = umap.find(now);
        int frequency;
        if (ptr == umap.end()) {
            umap[now] = 0;
        }
        umap[now] += 1;
    }
    
    int max_num; int max = 0;
    for (const auto& it : umap) {
        int num = it.first;
        int freq = it.second;
        if (freq > max) {
            max = freq;
            max_num = num;
        }
    }
    cout << max_num << endl;
    
    return 0;
}