#include <fstream>
#include <algorithm>

using namespace std;

int n, i, v[1000004], t;

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

int main(){
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];
    sort(v+1, v+n+1);
    for(i=1;i<=n/2;i++)
        if(v[i+n/2] == v[i]){
            fout<<v[i]<<" ";
            t = i;
            while(v[t] == v[i] && t<=n)
                t++;
            fout<<t-i;
            return 0;
        }
    fout<<-1;
    return 0;
}