#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ul unsigned ll
#define LL __int128_t
#define db double
#define DB long db
#define pii pair<int, int>
#define fi first
#define se second
#define mkpr make_pair
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define rsz resize
#define eb emplace_back
#define all(c) (c).begin(), (c).end()
#define bit(k) (1 << (k))
#define Bit(k) (1ll << (k))
#define BIT(k) ((LL)1 << (k))
#define lowbit(x) ((x) & -(x))
#define bin(s, k) ((s) >> (k) & 1)
#define lg2(x) (31 - __builtin_clz(x))
#define LG2(x) (63 - __builtin_clzll(x))
#define popcnt(x) __builtin_popcount(x)
#define mem(a, x) memset(a, x, sizeof(a))
#define req(i, l, r) for (int i(l), i##End(r); i < i##End; i = -~i)
#define rep(i, l, r) for (int i(l), i##End(r); i <= i##End; i = -~i)
#define per(i, r, l) for (int i(r), i##End(l); i >= i##End; i = ~-i)

// #define FILERR

#ifdef JYR
#ifdef FILERR
auto filerr = fopen("Test.err", "w");
#else
auto filerr = stderr;
#endif
#define errs(x) fputs(x "\n", filerr)
#define errm(x, ...) fprintf(filerr, x, ##__VA_ARGS__)
#else
#define errs(x) 0
#define errm(x, ...) 0
#endif

template<typename T, typename U> void chkmx(T &_a, U _b) { if (_a < _b) _a = _b; }
template<typename T, typename U> void chkmn(T &_a, U _b) { if (_b < _a) _a = _b; }
template<typename T> T sq(T x) { return x * x; }

bool Mbe;

struct FastIO {
    char buf[1 << 20], *p1, *p2;
    char puf[1 << 20], *pf;

    FastIO() : p1(buf), p2(buf), pf(puf) {}
    ~FastIO() { fwrite(puf, 1, pf - puf, stdout); }

    char gc() {
        if (p1 == p2) p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin);
        return p1 == p2 ? EOF : *p1++;
    }

    bool blank(char c) { return c == ' ' || c == '\r' || c == '\n' || c == '\t'; }

    char rd() {
        char c = gc(); while (blank(c)) c = gc();
        return c;
    }

    template<typename T> T rd() {
        T x = 0; int f = 0; char c = gc();
        while (!isdigit(c)) f = (c == '-'), c = gc();
        while (isdigit(c)) x = (x << 1) + (x << 3) + (c - '0'), c = gc();
        return f ? -x : x;
    }

    int rds(char *s) {
        char c = gc(), *S = s;
        while (blank(c)) c = gc();
        if (c == EOF) return *s = 0;
        while (!blank(c) && c != EOF) *s++ = c, c = gc();
        return *s = 0, abs(s - S);
    }

    int rdl(char *s) {
        char c = gc(), *S = s;
        while (c == '\r' || c == '\n') c = gc();
        if (c == EOF) return *s = 0;
        while (c != '\r' && c != '\n' && c != EOF) *s++ = c, c = gc();
        return *s = 0, abs(s - S);
    }

    void rd(char &c) { c = rd(); }

    void rd(char *s) {
        char c = gc();
        while (blank(c)) c = gc();
        if (c == EOF) { *s = 0; return; }
        while (!blank(c) && c != EOF) *s++ = c, c = gc();
        *s = 0;
    }

    template<typename T> void rd(T &x) {
        x = 0; int f = 0; char c = gc();
        while (!isdigit(c)) f = (c == '-'), c = gc();
        while (isdigit(c)) x = (x << 1) + (x << 3) + (c - '0'), c = gc();
        if (f) x = -x;
    }

    template<typename T, typename... Ts>
    void rd(T& x, Ts&... xs) { rd(x), rd(xs...); }

    void pc(const char &c) {
        if (pf - puf == 1 << 20) fwrite(pf = puf, 1, 1 << 20, stdout);
        *pf++ = c;
    }

    void prt(char c) { pc(c); }
    void prt(char* s) { while (*s) pc(*s++); }
    void prt(const char* s) { while (*s) pc(*s++); }

    template<typename T> void prt(T x) {
        static int st[41], tp = 0;
        if (x == 0) { pc('0'); return; }
        if (x < 0) x = -x, pc('-');
        while (x) st[++tp] = x % 10, x /= 10;
        while (tp) pc(st[tp--] + '0');
    }

    template<typename T> void prt(T *x) { while (*x) pc(*x++); }

    template<typename T, typename... Ts>
    void prt(T x, Ts... xs) { prt(x), prt(xs...); }

    void prts(const char *s, char c = '\n') {
        while (*s) pc(*s++);
        if (c) pc(c);
    }
} IO;

#define rd IO.rd
#define rds IO.rds
#define ri rd<int>()
#define rl rd<ll>()
#define prt IO.prt
#define prs IO.prts
#define edl IO.pc('\n')

// #define MC

#define N 45
#define mod 998244353
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f

struct node {
    int c;
    ll s;
    node(int _c = inf, ll _s = 0) : c(_c), s(_s) {}
};
bool operator< (const node &a, const node &b) { return a.c < b.c; }
bool operator==(const node &a, const node &b) { return a.c == b.c; }
node operator+ (const node &a, const node &b) { return node(a.c, a.s + b.s); }
node& operator+=(node &a, const node &b) { return a.s += b.s, a; }
// unordered_map<ll, node> f, g;
vector<pair<ll, node>> f, g;

int n;
int a[N];
ll su[N];
node ans[N];
char _c[11];

void mslv() {
    rd(n);
    rep(i, 1, n) a[i] = ri - 1;
    f.eb((Bit(n) - 1) ^ Bit(a[1]), node(0, 1));
    f.eb(Bit(n) - 1, node(0, 1));
    per(i, n, 1) su[i] = su[i + 1] | Bit(a[i]);
    rep(i, 2, n) {
        for (auto [S, u] : f) {
            ll s = S;
            rep(_, 0, 1) {
                s ^= Bit(a[i]);
                // 1st. find next |
                ll c = su[i + 1] & (Bit(a[i]) - 1);
                if (!c) c = -1;
                else c = Bit(LG2(c));
                // 2nd. get next group(with a[i])
                ll p = s & (Bit(a[i] + 1) - 1) & ~(c == -1 ? 0 : (c << 1) - 1);
                // 3rd. find endpos of prev group
                ll d = __builtin_ctzll((s & ~(Bit(a[i] + 1) - 1)) | Bit(n));
                // 4th. left shift
                ll t = p << (d - a[i] - _);
                if (_ == 1) u.c += __builtin_popcountll(s & ~(Bit(a[i] + 1) - 1) & ~su[i + 1]);
                g.eb(s ^ p ^ t, u);
            }
        }
        sort(all(g)), f.rsz(1), f[0] = g[0];
        req(j, 1, g.size()) if (f.back().fi == g[j].fi) {
            auto &[_, v] = f.back();
            auto [__, u] = g[j];
            if (u < v) v = u;
            else if (v == u) v += u;
        } else f.eb(g[j]);
        g.clear();
    }
    rep(i, 1, n) ans[i] = node(inf);
    for (auto [s, u] : f) {
        auto &v = ans[__builtin_popcountll(s)];
        if (u < v) v = u;
        else if (v == u) v += u;
    }
    rep(i, 1, n) prt(ans[i].c, ' ', ans[i].s), edl;
}

void mprw() {}

bool Med;

int main() {
    #ifdef JYR
    errs("Running!");
    freopen("Test.in", "r", stdin);
    freopen("Test.out", "w", stdout);
    #endif
    mprw();
    #ifdef MC
    int _ = ri;
    while (_--) mslv();
    #else
    mslv();
    #endif
    errm("%.3lfMB %.0lfms\n", abs(&Med - &Mbe) / 1048576., clock() * 1000. / CLOCKS_PER_SEC);
    return 0;
}

// #include <bits/stdc++.h>
// using namespace std;

// #define ll long long
// #define ul unsigned ll
// #define LL __int128_t
// #define db double
// #define DB long db
// #define pii pair<int, int>
// #define fi first
// #define se second
// #define mkpr make_pair
// #define vi vector<int>
// #define vl vector<ll>
// #define vii vector<pii>
// #define rsz resize
// #define eb emplace_back
// #define all(c) (c).begin(), (c).end()
// #define bit(k) (1 << (k))
// #define Bit(k) (1ll << (k))
// #define BIT(k) ((LL)1 << (k))
// #define lowbit(x) ((x) & -(x))
// #define bin(s, k) ((s) >> (k) & 1)
// #define lg2(x) (31 - __builtin_clz(x))
// #define LG2(x) (63 - __builtin_clzll(x))
// #define popcnt(x) __builtin_popcount(x)
// #define mem(a, x) memset(a, x, sizeof(a))
// #define req(i, l, r) for (int i(l), i##End(r); i < i##End; i = -~i)
// #define rep(i, l, r) for (int i(l), i##End(r); i <= i##End; i = -~i)
// #define per(i, r, l) for (int i(r), i##End(l); i >= i##End; i = ~-i)

// // #define FILERR

// #ifdef JYR
// #ifdef FILERR
// auto filerr = fopen("Test.err", "w");
// #else
// auto filerr = stderr;
// #endif
// #define errs(x) fputs(x "\n", filerr)
// #define errm(x, ...) fprintf(filerr, x, ##__VA_ARGS__)
// #else
// #define errs(x) 0
// #define errm(x, ...) 0
// #endif

// template<typename T, typename U> void chkmx(T &_a, U _b) { if (_a < _b) _a = _b; }
// template<typename T, typename U> void chkmn(T &_a, U _b) { if (_b < _a) _a = _b; }
// template<typename T> T sq(T x) { return x * x; }

// bool Mbe;

// struct FastIO {
//     char buf[1 << 20], *p1, *p2;
//     char puf[1 << 20], *pf;

//     FastIO() : p1(buf), p2(buf), pf(puf) {}
//     ~FastIO() { fwrite(puf, 1, pf - puf, stdout); }

//     char gc() {
//         if (p1 == p2) p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin);
//         return p1 == p2 ? EOF : *p1++;
//     }

//     bool blank(char c) { return c == ' ' || c == '\r' || c == '\n' || c == '\t'; }

//     char rd() {
//         char c = gc(); while (blank(c)) c = gc();
//         return c;
//     }

//     template<typename T> T rd() {
//         T x = 0; int f = 0; char c = gc();
//         while (!isdigit(c)) f = (c == '-'), c = gc();
//         while (isdigit(c)) x = (x << 1) + (x << 3) + (c - '0'), c = gc();
//         return f ? -x : x;
//     }

//     int rds(char *s) {
//         char c = gc(), *S = s;
//         while (blank(c)) c = gc();
//         if (c == EOF) return *s = 0;
//         while (!blank(c) && c != EOF) *s++ = c, c = gc();
//         return *s = 0, abs(s - S);
//     }

//     int rdl(char *s) {
//         char c = gc(), *S = s;
//         while (c == '\r' || c == '\n') c = gc();
//         if (c == EOF) return *s = 0;
//         while (c != '\r' && c != '\n' && c != EOF) *s++ = c, c = gc();
//         return *s = 0, abs(s - S);
//     }

//     void rd(char &c) { c = rd(); }

//     void rd(char *s) {
//         char c = gc();
//         while (blank(c)) c = gc();
//         if (c == EOF) { *s = 0; return; }
//         while (!blank(c) && c != EOF) *s++ = c, c = gc();
//         *s = 0;
//     }

//     template<typename T> void rd(T &x) {
//         x = 0; int f = 0; char c = gc();
//         while (!isdigit(c)) f = (c == '-'), c = gc();
//         while (isdigit(c)) x = (x << 1) + (x << 3) + (c - '0'), c = gc();
//         if (f) x = -x;
//     }

//     template<typename T, typename... Ts>
//     void rd(T& x, Ts&... xs) { rd(x), rd(xs...); }

//     void pc(const char &c) {
//         if (pf - puf == 1 << 20) fwrite(pf = puf, 1, 1 << 20, stdout);
//         *pf++ = c;
//     }

//     void prt(char c) { pc(c); }
//     void prt(char* s) { while (*s) pc(*s++); }
//     void prt(const char* s) { while (*s) pc(*s++); }

//     template<typename T> void prt(T x) {
//         static int st[41], tp = 0;
//         if (x == 0) { pc('0'); return; }
//         if (x < 0) x = -x, pc('-');
//         while (x) st[++tp] = x % 10, x /= 10;
//         while (tp) pc(st[tp--] + '0');
//     }

//     template<typename T> void prt(T *x) { while (*x) pc(*x++); }

//     template<typename T, typename... Ts>
//     void prt(T x, Ts... xs) { prt(x), prt(xs...); }

//     void prts(const char *s, char c = '\n') {
//         while (*s) pc(*s++);
//         if (c) pc(c);
//     }
// } IO;

// #define rd IO.rd
// #define rds IO.rds
// #define ri rd<int>()
// #define rl rd<ll>()
// #define prt IO.prt
// #define prs IO.prts
// #define edl IO.pc('\n')

// // #define MC

// #define N 45
// #define mod 998244353
// #define inf 0x3f3f3f3f
// #define INF 0x3f3f3f3f3f3f3f3f

// struct node {
//     int c;
//     ll s;
//     node(int _c = inf, ll _s = 0) : c(_c), s(_s) {}
// };
// bool operator< (const node &a, const node &b) { return a.c < b.c; }
// bool operator==(const node &a, const node &b) { return a.c == b.c; }
// node operator+ (const node &a, const node &b) { return node(a.c, a.s + b.s); }
// node& operator+=(node &a, const node &b) { return a.s += b.s, a; }
// unordered_map<ll, node> f, g;

// int n;
// int a[N];
// ll su[N];
// node ans[N];
// char _c[11];

// void mslv() {
//     rd(n);
//     rep(i, 1, n) a[i] = ri - 1;
//     f[(Bit(n) - 1) ^ Bit(a[1])] = node(0, 1);
//     f[Bit(n) - 1] = node(0, 1);
//     per(i, n, 1) su[i] = su[i + 1] | Bit(a[i]);
//     rep(i, 2, n) {
//         for (auto [S, u] : f) {
//             ll s = S;
//             rep(_, 0, 1) {
//                 s ^= Bit(a[i]);
//                 // 1st. find next |
//                 ll c = su[i + 1] & (Bit(a[i]) - 1);
//                 if (!c) c = -1;
//                 else c = Bit(LG2(c));
//                 // 2nd. get next group(with a[i])
//                 ll p = s & (Bit(a[i] + 1) - 1) & ~(c == -1 ? 0 : (c << 1) - 1);
//                 // 3rd. find endpos of prev group
//                 ll d = __builtin_ctzll((s & ~(Bit(a[i] + 1) - 1)) | Bit(n));
//                 // 4th. left shift
//                 ll t = p << (d - a[i] - _);
//                 auto &v = g[s ^ p ^ t];
//                 if (_ == 1) u.c += __builtin_popcountll(s & ~(Bit(a[i] + 1) - 1) & ~su[i + 1]);
//                 if (u < v) v = u;
//                 else if (v == u) v += u;
//             }
//         }
//         errm("g:"); for (auto [s, u] : g) errm(" | %lld [%d, %lld]", s, u.c, u.s); errs(" |");
//         if (i != n) swap(f, g), g.clear();
//     }
//     rep(i, 1, n) ans[i] = node(inf);
//     for (auto [s, u] : g) {
//         auto &v = ans[__builtin_popcountll(s)];
//         if (u < v) v = u;
//         else if (v == u) v += u;
//     }
//     rep(i, 1, n) prt(ans[i].c, ' ', ans[i].s), edl;
// }

// void mprw() {}

// bool Med;

// int main() {
//     #ifdef JYR
//     errs("Running!");
//     freopen("Test.in", "r", stdin);
//     freopen("Test.out", "w", stdout);
//     #endif
//     mprw();
//     #ifdef MC
//     int _ = ri;
//     while (_--) mslv();
//     #else
//     mslv();
//     #endif
//     errm("%.3lfMB %.0lfms\n", abs(&Med - &Mbe) / 1048576., clock() * 1000. / CLOCKS_PER_SEC);
//     return 0;
// }