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

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

int n,i,cnt,v[1000001];

int main(){
    fin>>n;

    for(i=1;i<=n;i++)
        fin>>v[i];
    sort(v+1,v+n+1);

    for(i=1;i<=n;i++){
        cnt=1;
        while(v[i]==v[i+1] && i<n)
            cnt++,i++;

        ///cout<<cnt<<"\n";

        if(cnt>n/2){
            fout<<v[i]<<" "<<cnt;
            return 0;
        }
    }

    fout<<-1;

    return 0;
}