#include <iostream>
#include <fstream>
#include <algorithm>

#define maxN 1000005

using namespace std;

ifstream fin("elmaj.in");
ofstream fout("elmaj.out");

int n;
int v[maxN];

int main()
{
    fin>>n;
    int x,k=1;
    fin>>x;
    v[1]=x;
    for (int i=2; i<=n; ++i)
    {
        fin>>v[i];
        if (v[i]!=x) --k;
        else ++k;
        if (k<0) { x=v[i]; k=1; }
    }
    k=0;
    for (int i=1; i<=n; ++i)
        if (v[i]==x) ++k;
    if (k>n/2) fout<<x<<' '<<k;
    else fout<<-1;
    return 0;
}