#include<bits/stdc++.h>
using namespace std;
struct info{
	int ans;long long cnt;
	info(int ans=780,long long cnt=0):ans(ans),cnt(cnt){}
	info &operator +=(const info &rhs){
		if (ans>rhs.ans) ans=rhs.ans,cnt=rhs.cnt;
		else if (ans==rhs.ans) cnt+=rhs.cnt; 
		return *this;
	}
};
int n,p,a[45],pw[45];
vector<int>pos,cnt;
vector<info>ldp,dp;
int main(){ scanf("%d",&n);
	for (int i=1;i<=n;i++) scanf("%d",&a[i]);
	for (int i=0;i<=n+1;i++) pos.emplace_back(i);
	dp.emplace_back(info(0,1));
	for (int i=1;i<=n;i++){
		p=lower_bound(pos.begin(),pos.end(),n+1-a[i])-pos.begin();
		const int len=(int)pos.size()-1; pw[0]=1;
		for (int i=1;i<=len;i++) pw[i]=pw[i-1]*(pos[i]-pos[i-1]);
		int lhstot=pos[p]-pos[p-1],rhstot=pos[p+1]-pos[p];
		cnt.resize(pw[p],0); swap(ldp,dp); dp.clear();
		dp.resize(pw[len]/lhstot/rhstot*(lhstot+rhstot)+1);
		for (int i=1,j=0;i<pw[p];i++){
			while (j<p&&pw[j+1]<=i) j++;
			cnt[i]=cnt[i%pw[j]]+i/pw[j];
		}
		const int step=pw[p+1]/lhstot/rhstot*(lhstot+rhstot);
		for (int low=0;low<pw[p];low++)
			for (int rhs=0,r1=0,r2=0;rhs<rhstot;rhs++,r1+=pw[p],r2+=pw[p-1])
				for (int upp=0,u=0;upp<pw[len];upp+=pw[p+1],u+=step){
					int lsta=low+r1+upp,sta=low+r2+u;
					dp[sta+pw[p-1]]+=info(ldp[lsta].ans+cnt[low],ldp[lsta].cnt);
					dp[sta]+=ldp[lsta];
				}
		pos.erase(pos.begin()+p);
	}
	for (int i=1;i<=n;i++)
		printf("%d %lld\n",dp[i].ans,dp[i].cnt);
    return 0;
}