#include<bits/stdc++.h>
using namespace std;
int T;
int n;
struct node{
	int a[5005];
}t;
int jc[50];
int dfs(int len,int cnt,node x)
{
	if(len==0)
	{
		return jc[cnt];
	}
	int id1=0,id2=0;
	for(int i=1;i<=(1<<len);i+=2)
	{
		if(x.a[i]%2!=1||x.a[i+1]!=x.a[i]+1)
		{
			if(id2!=0)
			{
				return 0;
			}
			id2=id1;
			id1=i;
		}
	}
	/*for(int i=1;i<=(1<<len);i++)
	{
		cout<<x.a[i]<<" ";
	}
	cout<<endl;
	cout<<"::"<<id1<<" "<<id2<<endl<<endl;*/
	node xx=x;
	memset(xx.a,0,sizeof(xx.a));
	if(id2==0&&id1==0)
	{
		for(int i=1;i<=(1<<len);i+=2)
		{
			xx.a[(i+1)/2]=(x.a[i]+1)/2;
		}
		return dfs(len-1,cnt,xx);
		memset(xx.a,0,sizeof(xx.a));
	}
	else if(id2==0)
	{
		swap(x.a[id1],x.a[id1+1]); 
		for(int i=1;i<=(1<<len);i+=2)
		{
			xx.a[(i+1)/2]=(x.a[i]+1)/2;
		}
		return dfs(len-1,cnt+1,xx);
		memset(xx.a,0,sizeof(xx.a));
	}
	else
	{
		if(x.a[id1]%2==0&&x.a[id2]%2==0)
		{
			return 0;
		}
		else if(x.a[id1]%2==0) 
		{
			swap(x.a[id1],x.a[id2+1]);
			for(int i=1;i<=(1<<len);i+=2)
			{
				xx.a[(i+1)/2]=(x.a[i]+1)/2;
			}
			return dfs(len-1,cnt+1,xx);
			memset(xx.a,0,sizeof(xx.a));
		}
		else if(x.a[id2]%2==0)
		{
			swap(x.a[id1+1],x.a[id2]);
			for(int i=1;i<=(1<<len);i+=2)
			{
				xx.a[(i+1)/2]=(x.a[i]+1)/2;
			}
			return dfs(len-1,cnt+1,xx);
			memset(xx.a,0,sizeof(xx.a));
		}
		else
		{
			//cout<<"!!"<<endl; 
			int re=0;
			swap(x.a[id1],x.a[id2]);
			for(int i=1;i<=(1<<len);i+=2)
			{
				xx.a[(i+1)/2]=(x.a[i]+1)/2;
			}
			re+=dfs(len-1,cnt+1,xx);
			memset(xx.a,0,sizeof(xx.a)); 
			swap(x.a[id1],x.a[id2]);
			swap(x.a[id1+1],x.a[id2+1]);
			for(int i=1;i<=(1<<len);i+=2)
			{
				xx.a[(i+1)/2]=(x.a[i]+1)/2;
			}
			re+=dfs(len-1,cnt+1,xx);
			return re;
			memset(xx.a,0,sizeof(xx.a));
		}
	}
}
signed main()
{
	jc[0]=1;
	for(int i=1;i<=24;i++)
	{
		jc[i]=jc[i-1]*i;
	}
	cin>>T;
	for(int i=1;i<=T;i++)
	{
		cin>>n;
		for(int i=1;i<=(1<<n);i++)
		{
			cin>>t.a[i];
		}
		cout<<"Case #"<<i<<": "<<dfs(n,0,t)<<endl;
	}
	return 0;
}