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

using namespace std;

int main()
{
    int N, x;

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

    map<int, int> elements;

    in >> N;
    while(in >> x){
        elements[x]++;
    }

    auto maximum = max_element(elements.begin(), elements.end(),
            [](const pair<int, int> &p1, const pair<int, int> &p2){
                return p1.second < p2.second;
            });

    if(maximum->second >= N/2 + 1){
        out << maximum->first << ' ' << maximum->second;
    }
    else{
        out << "-1";
    }

    return 0;
}