#include<bits/stdc++.h>
#define ll long long
using namespace std;
mt19937 rnd(time(0));
pair<int,ll> operator+(const pair<int,ll> &a,const pair<int,ll> &b){
	if(a.first==b.first) return make_pair(a.first,a.second+b.second);
	else if(a.first<b.first) return a;
	return b;
}
pair<int,ll> operator+(const pair<int,ll> &a,const ll &b){return make_pair(a.first+b,a.second);}
bool operator==(const pair<int,ll> &a,const pair<int,ll> &b){return a.first==b.first&&a.second==b.second;}
pair<int,ll> emp;
struct has_table{
    vector<pair<int,ll> > val,val2;
    vector<int> ne;
	ll la[200005],tot;
    inline void init(){
        tot=0,ne.emplace_back(0),val.emplace_back(emp),val2.emplace_back(emp);
    }
	inline void clear(){
		for(ll i=1;i<=tot;i++) la[(val[i].first*13331+val[i].second)%199997]=0,ne[i]=0;
        ne.clear(),val.clear(),val2.clear();
		tot=0,ne.emplace_back(0),val.emplace_back(emp),val2.emplace_back(emp);
	}
	inline void insert(const pair<int,ll> &a,const pair<int,ll> &b){
		ll numb = (a.first*13331+a.second)%199997;
		for(ll i=la[numb];i;i=ne[i]){
			if(val[i]==a){
				val2[i] = val2[i]+b;
				return ;
			}
		}
		tot++,ne.emplace_back(0),val.emplace_back(emp),val2.emplace_back(emp),ne[tot]=la[numb],la[numb]=tot,val[tot]=a,val2[tot]=b;
	}
}f[41],g[41];
ll n,i,j,k,l,o,a[55],p[55],maps[55][55],test,ans=0x3f3f3f3f3f3f3f3f,id[55],type[55],TYPE,qzh[55],tos[55],REAL=0x3f3f3f3f3f3f3f3f;
ll nums[5000005],nums2[5000005],nums3[5000005];
vector<ll> v,v2;
inline ll get_val(){
    ll res = 0;
    for(i=n;i>=1;i--) qzh[i]=qzh[i+1]|(1ll<<p[i]);
    for(i=1;i<=n;i++){
        ll cnt = 0;
        for(j=1;j<i;j++){
            ll temp = (tos[p[j]]&qzh[i]);
            if(temp==0||temp==qzh[i]) continue;
            cnt++;
        }
        res += (1ll<<cnt);
    }
    return res;
}
double T0 = 1e12;
inline double Rand(){return (double)rand()/RAND_MAX;}
ll T = 150;
int main(){
	cin>>n;
    if(n==1){
        cout<<0<<" "<<1<<endl;
        return 0;
    }
	for(i=1;i<=n;i++) cin>>a[i],p[i]=i,id[i]=i;
	for(i=1;i<=n;i++) for(j=i+1;j<=n;j++) if(a[i]>a[j]) maps[i][j]=1,tos[i]|=(1ll<<j),tos[j]|=(1ll<<i);
    while(REAL>1e6&&T--){
        T0 = 1e9;
        while(T0>1e-4){
            ll old_color = get_val();
            if(old_color<REAL){
                REAL = old_color;
                for(i=1;i<=n;i++) id[i]=p[i];
            }
            // cout<<old_color<<endl;
            ll pos1 = rnd()%n+1,pos2 = rnd()%n+1;
            while(pos1==pos2) pos1 = rnd()%n+1,pos2 = rnd()%n+1;
            swap(p[pos1],p[pos2]);
            ll new_color = get_val();
            if(new_color<old_color) continue;
            double delta = new_color-old_color;
            delta *= 2;
            if(exp(-delta/T0)<Rand()) swap(p[pos1],p[pos2]);
            T0 *= 0.99;
        }
        ll ans = get_val(),ans1 = -1,ans2 = -1;
        for(ll i=1;i<=n;i++){
            for(ll j=i+1;j<=n;j++){
                swap(p[i],p[j]);
                ll temp = get_val();
                if(temp<ans) ans=temp,ans1=i,ans2=j;
                swap(p[i],p[j]);
            }
        }
        if(ans1!=-1) swap(p[ans1],p[ans2]);
        if(ans<REAL){
            REAL = ans;
            for(i=1;i<=n;i++) id[i]=p[i];
        }
    }
    for(i=0;i<=40;i++) f[i].init(),g[i].init();
	f[0].insert(make_pair(0,0),make_pair(0,1));
	for(i=0;i<n;i++){
		v2.clear();
		for(j=1;j<=i+1;j++){
			ll temp = 0;
			for(k=i+2;k<=n;k++) temp += maps[id[j]][id[k]],temp += maps[id[k]][id[j]];
			if(temp==0){
				type[id[j]] = 0;
				continue;
			}
			if(temp==n-(i+2)+1){
				type[id[j]] = -1;
				continue;
			}
			v2.emplace_back(id[j]),type[id[j]] = v2.size();
		}
		ll len = (1ll<<v.size());
		for(j=0;j<(1ll<<v.size());j++){
			nums[j] = 0,nums2[j] = 0,nums3[j] = 0;
			for(k=0;k<v.size();k++){
				if((j>>k)&1){
					if(maps[id[i+1]][v[k]]||maps[v[k]][id[i+1]]) nums3[j]++;
					if(type[v[k]]==-1) nums[j]++;
					else if(type[v[k]]) nums2[j]|=(1ll<<type[v[k]]-1);
				}
			} 
		}
		if(!TYPE){
			for(j=0;j<=i;j++){
				for(test=1;test<=f[j].tot;test++){
					k = f[j].val[test].first,l = f[j].val[test].second;
					//不加
					ll delta_k = nums[l],new_num = nums2[l],numss = 0;
					g[j].insert(make_pair(k+delta_k,new_num),f[j].val2[test]);
					//加
					delta_k = nums[l],new_num = nums2[l],numss = nums3[l];
					if(type[id[i+1]]==-1) delta_k++;
					else if(type[id[i+1]]) new_num|=(1ll<<type[id[i+1]]-1);
					g[j+1].insert(make_pair(k+delta_k,new_num),f[j].val2[test]+(k+numss));
				}
			}
			for(j=0;j<=i+1;j++) f[j].clear();
		}
		else{
			for(j=0;j<=i;j++){
				for(test=1;test<=g[j].tot;test++){
					k = g[j].val[test].first,l =g[j].val[test].second;
					//不加
					ll delta_k = nums[l],new_num = nums2[l],numss = 0;
					f[j].insert(make_pair(k+delta_k,new_num),g[j].val2[test]);
					//加
					delta_k = nums[l],new_num = nums2[l],numss = nums3[l];
					if(type[id[i+1]]==-1) delta_k++;
					else if(type[id[i+1]]) new_num|=(1ll<<type[id[i+1]]-1);
					f[j+1].insert(make_pair(k+delta_k,new_num),g[j].val2[test]+(k+numss));
				}
			}
			for(j=0;j<=i+1;j++) g[j].clear();
		}
		v = v2,TYPE ^= 1;
	}
	for(i=1;i<=n;i++){
		pair<int,ll> ans = make_pair(0x3f3f3f3f,0);
		if(!TYPE) for(k=1;k<=f[i].tot;k++) ans=ans+f[i].val2[k];
		else for(k=1;k<=g[i].tot;k++) ans=ans+g[i].val2[k];
		cout<<ans.first<<" "<<ans.second<<endl;
	}
	return 0;
}