#include <iostream>
#include <fstream>
#include <cstdlib>
#define MAXN 5000
using namespace std;

int compare (const void * a, const void * b)
{
  return ( *(int*)a - *(int*)b );
}

int main()
{
    int i = 0;
    long long n;
    long long prom;
    long long arr[MAXN];
    ifstream file;
    file.open("pooh.in");
    file >> n;
    while(!file.eof())
    {
        file >> prom;
        arr[i] = prom;
        i++;
        //cout << prom<<" ";
    }
    file.close();
    //cout << n;
    //getch();
    qsort (arr, n, sizeof(int), compare);
//    for(int i =0; i<n; i++)
//    {
//        cout << arr[i];
//    }
    long long maxSum = 0;
    long long maxN = 0;
    long long tempSum = arr[0];
    long long tempN = arr[0];
    for(int i = 1; i<n; i++)
    {
        if(arr[i] == tempN)
        {
            tempSum = tempSum+arr[i];
        }
        else
        {
            if(maxSum < tempSum)
            {
                maxN = tempN;
            }
            tempSum = 0;
            //cout << tempN << endl;
            tempN = arr[i];
        }
    }
    if(tempSum > maxSum)
    {
        maxN = tempN;
    }

    ofstream file2;
    file2.open("pooh.out");
    file2 << maxN << endl;
    file2.close();

    return 0;
}