#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=12;
int T;
int n;
ll jc[N+5];
ll ans;
vector<int> a;
void dfs(vector<int> a,int len){
    if(a.size()==1){
        ans+=jc[len];
        return;
    }
    vector<int> f;
    for(int i=0;i<a.size();i+=2){
        if(a[i]+1!=a[i+1]||a[i]%2==1){
            f.push_back(i);
        }
    }
    vector<int> b,c;
    if(f.size()<=1){
        for(int i=0;i<a.size();i+=2){
            b.push_back(a[i]/2);
        }
        dfs(b,len+f.size());
        return;
    }
    if(f.size()>2)return;
    if(a[f[0]]==a[f[0]+1]+1&&a[f[0]]%2==1)return;
    c=a;
    if(a[f[0]]+1==a[f[1]+1]&&a[f[1]]+1==a[f[0]+1]){
        b.clear();
        swap(a[f[0]],a[f[1]]);
        for(int i=0;i<a.size();i+=2){
            b.push_back(a[i]/2);
        }
        dfs(b,len+1);
    }
    a=c;
    if(a[f[0]+1]+1==a[f[1]+1]&&a[f[0]]+1==a[f[1]]){
        b.clear();
        swap(a[f[0]+1],a[f[1]]);
        for(int i=0;i<a.size();i+=2){
            b.push_back(a[i]/2);
        }
        dfs(b,len+1);
    }
    a=c;
    if(a[f[0]]==a[f[1]]+1&&a[f[0]+1]==a[f[1]+1]+1){
        b.clear();
        swap(a[f[0]],a[f[1]+1]);
        for(int i=0;i<a.size();i+=2){
            b.push_back(a[i]/2);
        }
        dfs(b,len+1);
    }
    a=c;
    if(a[f[0]+1]==a[f[1]]+1&&a[f[1]+1]==a[f[0]]+1){
        b.clear();
        swap(a[f[0]+1],a[f[1]+1]);
        for(int i=0;i<a.size();i+=2){
            b.push_back(a[i]/2);
        }
        dfs(b,len+1);
    }
}
int main(){
    jc[0]=1;
    for(int i=1;i<=N;++i)jc[i]=jc[i-1]*i;
    cin>>T;
    for(int TT=1;TT<=T;++TT){
        cin>>n;
        a.clear();
        ans=0;
        for(int i=0;i<(1<<n);++i){
            int ls;
            cin>>ls;
            --ls;
            a.push_back(ls);
        }
        dfs(a,0);
        printf("Case #%d: %lld\n",TT,ans);
    }
    return 0;
}