#include<iostream>
#include<algorithm>
#include<unordered_map>

using namespace std;

const int N = 1010;

int n;
int cnt[N];

struct A
{
    int v,c;
}q[N];

int cmp(A a,A b)
{
    if(a.c!=b.c) return a.c>b.c;
    else return a.v<b.v;
}

int main()
{
    cin>>n;
    while(n--)
    {
        int x;
        cin>>x;
        cnt[x]++;
    }
    int k = 0;
    for(int i = 0; i<N; i++)
        if(cnt[i])
        {
            q[k++] = {i,cnt[i]};
        }
    sort(q,q+k,cmp);
    for(int i = 0; i<k; i++)
        cout<<q[i].v<<" "<<q[i].c<<endl;
    return 0;
}