#include <iostream>
#include <fstream>

using namespace std;

int a[1000001];

int mooreMajority(int n, int a[])
{
    int cand = -1, k = 0;
    for (int i = 0; i < n; i++)
    {
        if (k == 0)
        {
            cand = a[i];
            k = 1;
        }
        else if (a[i] == cand)
        {
            k++;
        }
        else
            k--;
    }
    if (cand < 0)
        return cand;
    int nr = 0;
    for (int i = 0; i < n; i++)
    {
        if (a[i] == cand)
            nr++;
    }
    if (nr > n / 2)
        return cand;
    else
        return -1;
}

int main()
{
    ifstream fin ("elmaj.in");
    ofstream fout ("elmaj.out");
    int n;
    fin>>n;
    for (int i=0; i<n; i++)
        fin>>a[i];
    fout<<mooreMajority(n,a);
    return 0;
}