#include <iostream>
#include <unordered_map>
using namespace std;

int main() 
{
  int n, frequentNum, maxCount = 0;
  cin >> n;
  
  int a[n];
  for(int i = 0; i < n; ++i)
    cin >> a[i];
    
  unordered_map<int, int> container;
  for(const int& num : a)
    container[num]++;
    
  for(const auto& num : container)
  {
    if(num.second > maxCount)
    {
      maxCount = num.second;
      frequentNum = num.first;
    }
  }
  
  cout << frequentNum;
  
  return 0;
}