#include <iostream>
#include <fstream>
#include <unordered_map>

int main ()
{
	std::ifstream in("elmaj.in");
	
	int N;
	in >> N;
	std::unordered_map<int, int> m;
	for (int i = 0; i < N; ++ i) {
		int x;
		in >> x;
		m[x]++;
	}
	
	std::ofstream out("elmaj.out");
	bool found = false;
	for (auto entry : m) {
		if (entry.second > N/2) {
			out << entry.first << " " << entry.second << "\n";
			found = true;
			break;
		}
	}
	if (!found) {
		out << "-1\n";
	}

	out.close();
	in.close();
	return 0;
}