#include <bits/stdc++.h>

using namespace std;


/**

Algoritmi randomizati


NP-complete

*/

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

int n, a[1000005];

int main()
{
    int i , x, cnt;
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> a[i];
    nth_element (a + 1, a + n / 2, a + n + 1);
    cnt = 0;
    x = a[n / 2];
    for (int i = 1; i <= n; i++)
        if (a[i] == x)
            cnt++;
    if (cnt < n / 2)
        fout << "-1\n";
    else
        fout << x << " " << cnt << "\n";
    return 0;
}