#include <iostream>
#include <unordered_map>
#include <algorithm>

using namespace std;

int main() {
    int n;
    
    cin >> n;
    
    unordered_map<int, int> counts;
    
    for (auto i = 0; i < n; ++i) {
        int id;
        cin >> id;
        ++counts[id];
    }
    
    int maxId = 0;
    
    for (auto e : counts) {
        if (e.second > counts[maxId]) {
            maxId = e.first;
        }
    }
    
    cout << maxId << endl;
    
    return 0;
}