#include <iostream>
#include <fstream>
#include <algorithm>
#define MAX 1000002
using namespace std;
int n,v[MAX];

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

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