#include<fstream>
#include<string.h>
#include<ctype.h>
#include<iostream>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<array>
#include<deque>
#include<math.h>
#include<functional>
#include<unordered_set>
#include<set>
#include<iomanip>
#include<bitset>
using namespace std;
unordered_map<int, int>mp;
unordered_map<int, int>::iterator it;
int i, n, el;
int main()
{
	//ifstream f("file.in");
	//ofstream g("file.out");
	ifstream f("elmaj.in");
	ofstream g("elmaj.out");
	f >> n;
	for (i = 1; i <= n; i++)
	{
		f >> el;
		mp[el]++;
	}
	it = mp.begin();
	while (it != mp.end())
	{
		if (it->second >= (n / 2) + 1)
		{
			g << it->first<<" "<<it->second;
			return 0;
		}
	}
	g << -1;
	return 0;
}