1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define PB push_back
#define ST first
#define ND second
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

typedef unsigned int uint;

const int N = 26;
uint masks[1 << N];
sint zg[1 << N];
char ro[1 << N];
char hb[1 << N];
int a[N];
int minZg[N + 1];
int spos[N + 1];
int n;

int main() {
	scanf("%d", &n);
	REP(i, n) {
		scanf("%d", &a[i]);
		--a[i];
		minZg[i + 1] = N * N;
	}
	int lastPot = 0;
	FOR(i, 1, (1 << n) - 1) {
		if (i >> lastPot) {
			++lastPot;
		}
		hb[i] = lastPot - 1;
		ro[i] = ro[i ^ (1 << hb[i])] + 1;
	}
	FOR(i, 1, (1 << n) - 1) {
		int lastOne = hb[i];
		int prevMask = i ^ (1 << lastOne);
		int prevMapped = masks[prevMask];
		int violating = prevMapped >> a[lastOne];
		zg[i] = zg[prevMask] + ro[violating];
		if (zg[i] < minZg[ro[i]]) {
			minZg[ro[i]] = zg[i];
			spos[ro[i]] = 1;
		} else if (zg[i] == minZg[ro[i]]) {
			++spos[ro[i]];
		}
		masks[i] = masks[prevMask] | (1 << a[lastOne]);
		// printf("mask: %d, zg: %d, used: %d, violating: %d\n", i, zg[i], masks[i], violating);
	}
	FOR(i, 1, n) {
		printf("%d %d\n", minZg[i], spos[i]);
	}
	return 0;
}