#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

int n;
vector <int> sir;

int main() {

    in >> n;

    for(int i = 0; i < n; i++){
        int x;
        in >> x;
        sir.push_back(x);
    }

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

    int maj = n / 2 + 1;
    int nrap = 1;

    for(int i = 0; i < sir.size() - 1; i++){
        if(sir[i] == sir[i + 1])
            nrap++;
        else{
            if(sir[i] != sir[i + 1] && nrap >= maj){
                out << sir[i] << " " << nrap;
                return 0;
            } else
                nrap = 1;
        }
    }

    out << "-1";

    return 0;
}