#include<bits/stdc++.h>
using std::cin, std::cout;
using ll = long long;
using u64 = unsigned long long;
namespace rgs = std::ranges;
struct pr {
	int v; ll c;
	pr(int V = 1e9, ll C = 1) : v(V), c(C) {}
	pr& operator += (const pr & b) {
		if(b.v < v) *this = b;
		else if(b.v == v) c += b.c;
		return *this;
	}
	pr inc(int z) const {
		return {v + z, c};
	}
};

const int N = 45;
std::map<std::vector<int>, std::array<pr, N>> dp[N];
pr ans[N];

int n;
int p[N];
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	for(int i = 1;i <= n;++i) {
		cin >> p[i];
		p[i] = n + 1 - p[i];
	}

	dp[0][std::vector<int>(n)][0] = pr(0, 1);
	for(int i = 1;i <= n;++i) {
		int rank = 0;
		for(int j = i + 1;j <= n;++j) {
			rank += p[j] < p[i];
		}
		for(auto & [u, v] : dp[i - 1]) {
			auto z0 = u;
			auto z1 = u;
			int sum = 0;
			for(int i = 0;i <= rank;++i) sum += z0[i];
			if(rank + 1 < (int) z0.size()) {
				z0[rank + 1] += z0[rank];
				z1[rank + 1] += z1[rank] + 1;
			}
			z0.erase(z0.begin() + rank);
			z1.erase(z1.begin() + rank);

			auto & t0 = dp[i][z0];
			auto & t1 = dp[i][z1];
			for(int k = 0;k <= n;++k) {
				t0[k] += v[k];
				t1[k + 1] += v[k].inc(sum);
			}
		}
		dp[i - 1].clear();
	}
	for(auto & [u, v] : dp[n]) {
		for(int k = 0;k <= n;++k) ans[k] += v[k];
	}
	for(int k = 1;k <= n;++k) {
		cout << ans[k].v << ' ' << ans[k].c << '\n';
	}
}