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

using namespace std;

vector <int> a;

void read()
{
    int n;
    cin >> n;
    a.resize(n);

    for (int i = 0; i < a.size(); cin >> a[i++] );
}

void write()
{
    sort(a.begin(), a.end());

    int x = a[a.size() / 2], y = count(a.begin(), a.end(), x);
    if (y > a.size() / 2) cout << x << ' ' << y; else cout << -1;
}

int main()
{
    read();

    write();

    return 0;
}