#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
    int n;
    vector<int> v;
    
    cin >> n;
    
    int tmp;
    for (int i = 0; i < n; i++) {
        cin >> tmp >> std::ws;
        v.push_back(tmp);
    }
    
    sort(v.begin(), v.end());
    v.push_back(-1);
    
    
    int ct = 0;
    int mx_ct = 0;
    int mx = 0;
    for (int j = 0; j < n; j++) {
        ct++;
        if (v.at(j) != v.at(j + 1)) {
            if (ct >= mx_ct) {
                mx_ct = ct;
                mx = v.at(j);
            }
            
            ct = 0;
        }
    }
    
    cout << mx << endl;
}