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

int v[1000005];

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

int main() {

    int n;
    in >> n;

    for(int i = 1; i <= n; i++)
        in >> v[i];

    sort(v+1, v+n+1);
    for(int i = 1; i <= n; i++) {
        int uw = upper_bound(v+i, v+n+1, v[i])-v-1;
        if(uw-i+1 > n/2) {
            out << v[i] << " " << uw-i+1;
            return 0;
        }
        i = uw;
    }
    out << "-1";

    return 0;
}