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

main() {
    ifstream cin("elmaj.in");
    ofstream cout("elmaj.out");
    int n, maj = -1;
    cin>>n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin>>a[i];
    }
    sort(a.begin(), a.end());
    int k = a[a.size()/2];
    n = upper_bound(a.begin(), a.end(), k) - lower_bound(a.begin(), a.end(), k);
    if (n > a.size()/2) {
        cout<<k<<" "<<n;
    } else {
        cout<<-1;
    }
}