#include<bits/stdc++.h>
using namespace std;
const int N=5005;
using ll=long long;
const int p=1e9+7;
int n;
int edge[N][N];
int deg[N];
int l_hash(char ch)
{
    if('0'<=ch&&ch<='9')
    {
        return ch-'0';
    }
    return ch-'A'+10;
}
int id[N],pos[N],val[N],vl[N],vr[N],sum[N];
int pre[N][3];
bool cmp(int x,int y)
{
    return deg[x]<deg[y];
}
int calc(int l,int r,int typ)
{
    int ans=pre[l-1][0]+(pre[n][0]-pre[r-1][0]);
    if(~typ)
    {
        ans+=pre[r-1][2]-pre[l-1][2];
    }
    else
    {
        ans+=pre[r-1][1]-pre[l-1][1];
    }
    return ans;
}
ll ans=0,bas;
int Calc(int u,int v)
{
    u=pos[u];
    v=pos[v];
    if(val[u]+1==val[v])
    {
        return pre[n][0];
    }
    if(vr[u]>=vl[v])
    {
        return calc(vl[v],vr[u],-1);
    }
    else
    {
        return calc(vr[u],vl[v],1);
    }
}
void solve()
{
    cin>>n;
    fill(deg+1,deg+n+1,0);
    for(int i=1;i<=n-1;i++)
    {
        string s;
        cin>>s;
        for(int j=1,k=0;j<=i-1;j+=4,k++)
        {
            edge[i+1][j]=l_hash(s[k])&1;
            edge[i+1][j+1]=l_hash(s[k])&2;
            edge[i+1][j+2]=l_hash(s[k])&4;
            edge[i+1][j+3]=l_hash(s[k])&8;
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=i-1;j++)
        {
            if(edge[i][j])
            {
                ++deg[i];
            }
            else
            {
                ++deg[j];
            }
        }
    }
    iota(id+1,id+n+1,1);
    sort(id+1,id+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        val[i]=deg[id[i]];
        sum[i]=sum[i-1]+val[i];
        pos[id[i]]=i;
    }
    for(int i=1;i<=n;i++)
    {
        sum[i]-=i*(i-1)/2;
        vl[i]=(i==1||(vl[i]^vl[i-1]))?i:vl[i-1];
    }
    vr[n+1]=0;
    for(int i=n;i>=1;i--)
    {
        vr[i]=(i==n||(vr[i]^vr[i+1]))?i:vr[i+1];
    }
    for(int i=1;i<=n;i++)
    {
        pre[i][0]=pre[i-1][0]+(sum[i]==0);
        pre[i][1]=pre[i-1][1]+(sum[i]==1);
        pre[i][2]=pre[i-1][2]+(sum[i]==-1);
    }
    ans=0,bas=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<i;j++)
        {
            ll res=(edge[i][j])?Calc(j,i):Calc(i,j);
            ans=(ans+res*bas%p)%p;
            bas=(bas<<1)%p;
        }
    }
    cout<<ans<<'\n';
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}