# include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;
long long jie[15];
long long dfs(vector<int> v,int n,int k)
{
    if(n==0)
        return jie[k];
    int pos=0;
    for(int i=0;i<1<<n;i+=2)
        if(!(v[i]%2 && v[i+1]==v[i]+1))
            pos++;
    if(pos==0 || pos==1)
    {
        vector<int> v2(1<<(n-1));
        for(int i=0;i<1<<n;i+=2)
            v2[i/2]=(v[i]+1)/2;
        return dfs(v2,n-1,k+pos);
    }
    else if(pos==2)
    {
        vector<int> v2(1<<(n-1));
        int pos1=-1,pos2=-1;
        for(int i=0;i<1<<n;i+=2)
            if(!(v[i]%2 && v[i+1]==v[i]+1))
            {
                if(pos1==-1)
                    pos1=i;
                else
                    pos2=i;
            }
        long long ans=0;
        for(int p1=pos1;p1<=pos1+1;p1++)
            for(int p2=pos2;p2<=pos2+1;p2++)
            {
                swap(v[p1],v[p2]);
                bool flag=0;
                for(int i=0;i<1<<n;i+=2)
                    if(!(v[i]%2 && v[i+1]==v[i]+1))
                    {
                        flag=1;
                        break;
                    }
                if(!flag)
                {
                    for(int i=0;i<1<<n;i+=2)
                        v2[i]=v[i+1]/2;
                    ans+=dfs(v2,n-1,k+1);
                }
                swap(v[p1],v[p2]);
            }
        return ans;
    }
    else
        return 0;
}
void solve(int testid)
{
    cin>>n;
    v.resize(1<<n);
    for(int i=0;i<1<<n;i++)
        cin>>v[i];
    cout<<"Case #"<<testid<<": "<<dfs(v,n,0)<<endl;
}
int main()
{
    jie[0]=1;
    for(int i=1;i<=12;i++)
        jie[i]=jie[i-1]*i;
    int T;
    cin>>T;
    for(int t=1;t<=T;t++)
        solve(t);
    return 0;
}