#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");

int main()
{
	int n, i, j;
	f >> n;
	vector<int> v(n, 0);
	for (i = 0; i < n; ++i) f >> v[i];
	sort(v.begin(), v.end());
	i = 0;
	while (i < n)
	{
		for (j = i; j < n && v[j + 1] == v[i]; ++j);
		if (j - i + 1 > n / 2)
		{
			g << v[i] << " " << j - i + 1 << '\n';
			return 0;
		}
		i = j + 1;
	}
	g << -1 << '\n';
}