#include <bits/stdc++.h>

using namespace std;

int n;
int a[1001];

struct node{
	int data;
	int c;
}b[1001];

bool cmp(node aa,node bb){
	if(aa.c == bb.c){
		return aa.data < bb.data;
	}
	return aa.c > bb.c;
}

int main(){
	
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	a[n] = -1;
	sort(a,a+n);
	
	int j = 0;
	int coun = 1;
	for(int i = 0; i < n; i++){
		if(a[i] == a[i+1]){
			coun++;
		}else{
			b[j].data = a[i];
			b[j].c = coun;
			j++;
			coun = 1;
		}
	}
	
	sort(b,b+j,cmp);
	
	for(int i = 0; i < j; i++){
		cout << b[i].data << " " << b[i].c << "\n";
	}
	return 0;
}