#include <bits/stdc++.h>

using namespace std; const int maxn = 3e3 + 5; typedef long long ll;

int fac[13];

int n, a[13][maxn];

ll ans;

inline bool go(int l)
{
    // for (int i = 0; i < 1 << l; i++) cerr << a[l][i] << ' '; cerr << endl;
    for (int i = 0; i < 1 << l; i += 2) if (a[l][i] & 1) return 0;
    for (int i = 0; i < 1 << l; i += 2) if (a[l][i + 1] != a[l][i] + 1) return 0;
    for (int i = 0; i < 1 << l; i += 2) a[l - 1][i >> 1] = a[l][i] >> 1;
    return 1;
}

void dfs(int l, int t)
{
    // cerr << l << ' ' << t << endl;
    if (l == 0)
    {
        ans += fac[t];
        return;
    }
    vector<int> sk;
    for (int i = 0; i < 1 << l; i += 2)
    {
        if (!(a[l][i] & 1) && a[l][i + 1] == a[l][i] + 1);
        else
        {
            sk.push_back(i);
        }
    }
    if (sk.size() == 0) assert(go(l)), dfs(l - 1, t);
    else if (sk.size() == 1)
    {
        // cerr << "!" << endl;
        swap(a[l][sk[0]], a[l][sk[0] + 1]);
        if (go(l)) dfs(l - 1, t + 1);
    }
    else if (sk.size() > 2) return;
    else
    {
        for (int x = 0; x < 2; x++) for (int y = 0; y < 2; y++)
        {
            swap(a[l][sk[0] + x], a[l][sk[1] + y]);
            if (go(l)) dfs(l - 1, t + 1);
            swap(a[l][sk[0] + x], a[l][sk[1] + y]);
        }
    }
}

inline void solve()
{
    scanf("%d", &n);
    for (int i = 0; i < 1 << n; i++) scanf("%d", a[n] + i), a[n][i]--;
    ans = 0;
    dfs(n, 0);
    printf("%lld\n", ans);
}

int main()
{
    for (int i = fac[0] = 1; i <= 12; i++) fac[i] = fac[i - 1] * i;
    int Tt; scanf("%d", &Tt); for (int i = 1; i <= Tt; i++) printf("Case #%d: ", i), solve();
    return 0;
}