#include <iostream>
#include <fstream>
#include <unordered_map>

using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
const int NMax = 1e6 + 5;

// solutie cu tabele de dispersie

int N;
int v[NMax];
unordered_map<int,int> mp;
// mp - tabelul hash
// mp[val] = retine de cate ori apare valoare val in vectorul initial

int main() {
    in>>N;
    for (int i=1;i <= N;++i) {
        in>>v[i];
        ++mp[v[i]];
    }

    for (int i=1;i <= N;++i) {
        if (mp[v[i]] > N/2) {
            out<<v[i]<<' '<<mp[v[i]]<<'\n';
            return 0;
        }
    }
    out<<"-1\n";

    in.close();out.close();
    return 0;
}