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


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int num_birds;
    std::cin >> num_birds;
    std::unordered_map<int, int> bird_map;
    for(int i = 0; i < num_birds; ++i)
    {
        int bird;
        std::cin >> bird;
        ++bird_map[bird];
    }
    int best_bird_id = std::numeric_limits<int>::max();
    int best_bird_val = 0;
    for(auto&& bpair : bird_map)
    {
        if(bpair.second > best_bird_val || bpair.second == best_bird_val && bpair.first < best_bird_id)
        {
            best_bird_id = bpair.first;
            best_bird_val = bpair.second;
        }
        
    }
    std::cout << best_bird_id << '\n';

    return 0;
}