#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #define LL long long

 #define rg register

 #define N 200010

 using namespace std;

 int n,a[N],cnt=;

 inline int read(){

     int k=,f=; char c=getchar();

     while(c<''||c>'')c=='-'&&(f=-),c=getchar();

     while(''<=c&&c<='')k=k*+c-'',c=getchar();

     return k*f;

 }

 int main(){

     n=read();

     for(rg int i=;i<=n;i++) a[i]=read();

     sort(a+,a++n);

     for(rg int i=;i<=n+;i++){

         if(a[i]!=a[i-]){

             printf("%d %d\n",a[i-],cnt);

             cnt=;

         }

         cnt++;

     }

     return ;

 }