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

bool compare_second(pair<int, int> lhs, pair<int, int> rhs) 
{
  if(lhs.second == rhs.second)
  {
      lhs.first > rhs.first;
  }
  return lhs.second < rhs.second; 
}

int main() {
    int birdCount, bird;
    map<int, int> birds;
    pair<map<int,int>::iterator,bool> ret;
    
    cin >> birdCount;
    for(size_t i = 0u; i < birdCount; ++i)
    {
        cin >> bird;
        ret = birds.insert ( pair<int,int>(bird, 1) );
        if(!ret.second)
        {
            ret.first->second += 1;
        }
    }
    
    map<int, int >::iterator maximum = max_element(birds.begin(), birds.end(), compare_second); 
    cout << maximum->first;
   
    return 0;
}