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 <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, int> PILL;
typedef pair<ll, ll> PLL;

const int MAX_N = 1e5+5;
const int M = 1e6;
const ll INF = (ll)(1e18);
const int inf = 1e9;
const ll MOD = 1000000007LL;

void solve() {

}

int n;
vector<PII> a;
vector<vector<PII>> subsets;
int smallest[45], ans[45];

int countConflicts(vector<PII> vec) {
    int ret = 0;
    int s = vec.size();
    sort(vec.begin(), vec.end());
    for (int i = 0; i < s; i++) {
        for (int j = i+1; j < s; j++) {
            if (vec[i].second > vec[j].second) ret++;
        }
    }

    return ret;
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    for (int i = 1; i <= n; i++) {
        smallest[i] = inf;
        ans[i] = 0;
    }
    a.resize(n+1);
    for (int i = 0; i < n; i++) {
        a[i].first = i+1;
        cin >> a[i].second;
    }

    for (int i = 0; i < (1 << n); i++) {
        vector<PII> cur;
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                cur.push_back(a[j]);
            }
        }
        subsets.push_back(cur);
    }

    for (auto vec: subsets) {
        int s = vec.size();
        int conflicts = countConflicts(vec);
        if (conflicts < smallest[s]) {
            smallest[s] = conflicts;
            ans[s] = 1;
        } else if (conflicts == smallest[s]) {
            ans[s]++;
        }
    }


    for (int i = 1; i <= n; i++) {
        cout << smallest[i] << " " << ans[i] << "\n";
    }



    return 0;
}