#include<bits/stdc++.h>
#define ll long long
#define int ll
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;++i)
#define REPA(i,j) for(int i=1;i<=j;++i)
#define vi vector<int>
#define pii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
using namespace std;
const ll MOD=1000000007;
inline void read(int &x){
//	short neg=1;
	x=0;
	char c=getchar();
	/*while(c<'0'||c>'9'){
		if(c=='-')neg=-1;
		c=getchar();
	}*/
	while(c>='0'&&c<='9'){
		x=(x<<3)+(x<<1)+(c^48);
		c=getchar();
	}
//	x*=neg;
}
ll quick_mod(ll A,ll B){//A^B
    ll ret=1;
    A%=MOD;
    while(B){
        if(B&1)ret=ret*A%MOD;
        B>>=1;
        A=A*A%MOD;
    }
    return ret;
}
inline void chkmin(ll &x,ll y){x=min(x,y);}
inline void chkmax(ll &x,ll y){x=max(x,y);}
inline void add(ll &x,ll y){x=(x+y)%MOD;}
inline ll rev(ll x){return quick_mod(x,MOD-2);}
inline int lowbit(int x){return x&(-x);}
const int MAXN=550;
int n,ban_ver,g[MAXN][MAXN];

int dfn[MAXN],low[MAXN];
int stk[MAXN],sz=0;
bool ins[MAXN];
int col[MAXN];
int cnt=0,num=0;
void tarjan(int x){
	ins[x]=1,dfn[x]=low[x]=++cnt;
	stk[++sz]=x;
	REPA(y,n)if(y!=ban_ver&&g[x][y]){
		if(!dfn[y]){
			tarjan(y);
			low[x]=min(low[x],low[y]);
		}
		else if(ins[y]){
			low[x]=min(low[x],dfn[y]);
		}
	}
	if(low[x]==dfn[x]){
		++num;
		while(x!=stk[sz]){
			ins[stk[sz]]=0;
			col[stk[sz]]=num;
			--sz;
		}
		ins[x]=0,col[x]=num;--sz;
	}
}
inline void solve(){
	memset(dfn,0,sizeof(dfn));
	memset(low,0,sizeof(low));
	memset(stk,0,sizeof(stk));
	memset(ins,0,sizeof(ins));
	sz=0,cnt=0,num=0;
	memset(col,0,sizeof(col));
	REPA(i,n)if(i!=ban_ver&&!dfn[i]){
		tarjan(i);
	}
//	cout<<"tarjan"<<ban_ver<<":\n";
//	REPA(i,n)cout<<col[i]<<" ";
//	cout<<"\n";
}
queue<int>Q;
int to16[300];
int pw2[MAXN*MAXN];
inline void run(){
	memset(g,0,sizeof(g));
	cin>>n;
	for(char c='0';c<='9';++c)to16[c]=c-'0';
	for(char c='A';c<='F';++c)to16[c]=c-'A'+10;
	for(int i=1;i<=n-1;++i){
		string s;cin>>s;int l=s.size();
		REP(j,l){
			int c=to16[s[j]];
			REP(k,4)if(4*(j+1)+k-3<i+1){
				if(c&(1<<k))g[i+1][4*(j+1)+k-3]=1;
				else g[4*(j+1)+k-3][i+1]=1;
			}
		}
	}
	int ans=0;
	pw2[0]=1;REPA(i,n*n+n)pw2[i]=pw2[i-1]*2%MOD;
	REPA(i,n){
		ban_ver=i;
		solve();
		int tmp=0;
		for(int j=1;j<i;++j){
			swap(g[i][j],g[j][i]);
			int min0=n+1,max1=0;
			REPA(k,n)if(k^i){
				if(g[i][k])max1=max(max1,col[k]);
				else min0=min(min0,col[k]);
			}
//			cout<<i<<"->"<<j<<":"<<max1<<","<<min0<<"::";
			if(min0==n+1||max1==0)tmp+=pw2[j-1]*(num+1)%MOD;
			else tmp+=pw2[j-1]*(num-(max1-min0))%MOD;
			swap(g[i][j],g[j][i]);
		}
		ans+=tmp%MOD*pw2[(i-2)*(i-1)/2]%MOD;
	}
	cout<<ans%MOD<<"\n";
} 
signed main(void){
//	freopen("tournament.in","r",stdin);
//	freopen("tournament.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int ttc;cin>>ttc;
	while(ttc--)run();
	return 0;
}
/*
think twice, code once;
think once, debug forever.
*/