#include <iostream>
#include <fstream>
#include <limits.h>
#include <vector>
#include <algorithm>
#include <unordered_map>

using namespace std;

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

int main()
{
	int n;
	fin >> n;

	int ans = -1;
	unordered_map<int, int> Aparitii;
	for (int i = 0; i < n; i++)
	{
		int x;
		fin >> x;
		Aparitii[x]++;

		if (Aparitii[x] > n / 2)
		{
			ans = x;
		}
	}

	if (ans == -1)
	{
		fout << ans;
	}
	else
	{
		fout << ans << ' ' << Aparitii[ans];
	}
}

/*

	
	GMAX: 12
	G   P
	7 | 9
	5 | 3
	1 | 1  

		 1 2 3 4 5 6 7 8 9 10 11 12 
	dp : 1 1 1 1 3 4 8 8 8  8  8  10


*/