#include <iostream>
#include <fstream>
#include <map>
#include <algorithm>
#include <string>

using namespace std;

int main()
{
    int N;

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

    in >> N;
    vector<int> elements(N);

    for(int i = 0; i < N; i++){
        in >> elements[i];
    }

    sort(elements.begin(), elements.end());

    int max_val = elements[N/2];

    int max_frequency = count(elements.begin(), elements.end(), max_val);

    if(max_frequency >= N/2 + 1){
        out << max_val << ' ' << max_frequency;
    }
    else{
        out << "-1";
    }

    return 0;
}