#include<bits/stdc++.h>
using namespace std;
int n,t[34],a[34],p[34],w[34];
long long z[34];
int marge_sort(int l,int r)
{
if(l == r) return 0;
int m = (l + r) >> 1;
int W = marge_sort(l,m) + marge_sort(m + 1,r);
int i = l,j = m + 1,poz = l;
while(poz <= r)
{
if(j > r || (i <= m && a[i] <= a[j])) p[poz] = a[i++];
else
{
p[poz] = a[j++];
W += m - i + 1;
}
poz++;
}
for(int i = l;i <= r; ++i) a[i] = p[i];
return W;
}
int main()
{
ios_base::sync_with_stdio(0);
cin>>n;
for(int i = 0;i < n; ++i)
{
cin>>t[i];
w[i + 1] = 1e6;
}
int x = 1 << n;
for(int i = 1;i < x; ++i)
{
int k = 0;
for(int j = 0;j < n; ++j)
if(i & (1 << j)) a[k++] = t[j];
int inw = marge_sort(0,k - 1);
if(w[k] > inw)
{
w[k] = inw;
z[k] = 1;
}
else if(w[k] == inw) z[k]++;
}
for(int i = 1;i <= n; ++i)
cout<<w[i]<<" "<<z[i]<<'\n';
return 0;
}