#include <bits/stdc++.h>

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

int N;
int v[NMax];

void solve(int,int,int);
int part(int,int);

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

    srand(time(0));
    solve(1,N,N/2);

    int val = v[N/2],nr = 0;
    for (int i=1;i <= N;++i) {
        if (v[i] == val) {
            ++nr;
        }
    }

    if (nr > N/2) {
        out<<val<<' '<<nr<<'\n';
    }
    else {
        out<<"-1\n";
    }

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

void solve(int st,int dr,int K) {
    if (st >= dr) {
        return;
    }

    int idx = part(st,dr);
    if (K <= idx) {
        solve(st,idx,K);
    }
    else {
        solve(idx+1,dr,K);
    }
}
int part(int st,int dr) {
    int idx = rand() % (dr-st+1) + st;
    swap(v[st],v[idx]);
    int pivot = v[st];

    int i = st-1,
        j = dr+1;
    while (true) {
        do {
            ++i;
        }
        while (v[i] < pivot);

        do {
            --j;
        }
        while (v[j] > pivot);

        if (i < j) {
            swap(v[i],v[j]);
        }
        else {
            return j;
        }
    }
}