# include<bits/stdc++.h>
using namespace std;
map<int,int> m;
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		auto t=m.find(x);
		if(t!=m.end()){
			t->second++;
		}
		else{
			m.insert(make_pair(x,1));
		}
	}
	for(auto t=m.begin();t!=m.end();t++){
		cout<<t->first<<" "<<t->second<<endl;
	}
	return 0;
}

#include<bits/stdc++.h>

using namespace std;

long long n;

bool cmp(pair<long long, long long>

a,pair<long long, long long> b)

{

return a.second<b.second;

}

int main()

{

cin>>n;

map<long long, long long> my_map;

for(int i=1;i<=n;i++)

cin>>my_map[i];

vector<pair<long long, long long> >

o(my_map.begin(),my_map.end());

sort(o.begin(),o.end(),cmp);

long long ans=1;

vector<pair<long long, long long> >::iterator

it=o.begin();

long long t=it->second;

for(it=o.begin()+1;it!=o.end();it++)

{

if(it!=o.end()-1)

{

if(it->second==t)

ans++;

else

{

cout<<t<<" "<<ans<<endl;

t=it->second;

ans=1;

}

}

else

cout<<t<<" "<<ans+1<<endl;

}

return 0;

}

# include<bits/stdc++.h>
using namespace std;
map<int,int> m;
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		auto t=m.find(x);
		if(t!=m.end()){
			t->second++;
		}
		else{
			m.insert(make_pair(x,1));
		}
	}
	for(auto t=m.begin();t!=m.end();t++){
		cout<<t->first<<" "<<t->second<<endl;
	}
	return 0;
}