#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <fstream>
using namespace std;

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

map <int, int> numere;
int n;
int main()
{
	fin >> n;
	int m = n;
	while (m--)
	{
		int x;
		fin >> x;
		if (numere.find(x) != numere.end())
			numere[x]++;
		else
			numere.insert(map<int,int>::value_type(x,1));
	}
	for (auto i = numere.begin(); i != numere.end(); ++i)
		if (i->second >= n / 2 + 1)
			fout << i -> first << ' ' << i->second;
	
	
}