#include <fstream>
#include <algorithm>
#include <cstdio>
using namespace std;

long long n,f[1000001],i,ok,ap,x,maxim;
FILE *fin = fopen ("elmaj.in","r");
//FILE *fout = fopen ("elmaj.out","w");
//ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");

int main (){

    //fin>>n;
    fscanf (fin, "%lld", &n);
    for (i=1;i<=n;i++){
        //fin>>v[i];
        fscanf (fin, "%lld",&x);
        f[x]++;
        if (f[x] > maxim){
           maxim = f[x];
           ap = x;
        }
    }
    if (maxim >= n/2+1)
        fout<<ap<<" "<<maxim;
    else
        fout<<-1;
    /*sort (v+1,v+n+1);
    ap = 1;
    ok = 0;
    for (i=2;i<=n;i++){
        if (v[i] == v[i-1])
            ap++;
        else{
            if (ap >= n/2+1){
                fprintf (fout, "%lld %lld",v[i-1],ap);
                //fout<<v[i-1]<<" "<<ap;
                ok = 1;
                break;
            }

            ap = 1;
        }
    }
    if (ok == 0)
        fprintf (fout,"-1");
        //fout<<-1;
*/
    return 0;
}