#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int , int> &p , pair<int , int> &p1)
{
	return p.second > p1.second;
}
int main() {
	// your code goes here
	int n,x = 6; cin>>n;
	map<int , int> m;
	for(int i = 0; i < n; i++)
	{
		int x; cin>>x;
		m[x]++;
	}
	pair<int , int> p[m.size()];
	int i = 0;
	for(auto itr = m.begin(); itr != m.end(); itr++)
	{
		p[i].first = itr -> first;
		p[i].second = itr -> second;
		i++;
	}
	sort(p , p + m.size(),cmp);
	for(int i = 0; i < m.size(); i++)
	{
		cout<<p[i].first<<" "<<p[i].second<<"\n";
	}
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmJvb2wgY21wKHBhaXI8aW50ICwgaW50PiAmcCAsIHBhaXI8aW50ICwgaW50PiAmcDEpCnsKCXJldHVybiBwLnNlY29uZCA+IHAxLnNlY29uZDsKfQppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuLHggPSA2OyBjaW4+Pm47CgltYXA8aW50ICwgaW50PiBtOwoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKykKCXsKCQlpbnQgeDsgY2luPj54OwoJCW1beF0rKzsKCX0KCXBhaXI8aW50ICwgaW50PiBwW20uc2l6ZSgpXTsKCWludCBpID0gMDsKCWZvcihhdXRvIGl0ciA9IG0uYmVnaW4oKTsgaXRyICE9IG0uZW5kKCk7IGl0cisrKQoJewoJCXBbaV0uZmlyc3QgPSBpdHIgLT4gZmlyc3Q7CgkJcFtpXS5zZWNvbmQgPSBpdHIgLT4gc2Vjb25kOwoJCWkrKzsKCX0KCXNvcnQocCAsIHAgKyBtLnNpemUoKSxjbXApOwoJZm9yKGludCBpID0gMDsgaSA8IG0uc2l6ZSgpOyBpKyspCgl7CgkJY291dDw8cFtpXS5maXJzdDw8IiAiPDxwW2ldLnNlY29uZDw8IlxuIjsKCX0KCXJldHVybiAwOwp9

OAoxIDIgNSAzIDEgNSAx

8
1 2 5 3 1 5 1