#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll mod = 1e9 + 7;
const int N = 5e3 + 5;
int n;
char s[N];
bool vis[N][N];
vector<int> E[N];
int low[N], dfn[N], col[N], tcnt, cnt;
stack<int> stk;
ll qpow(ll a, ll b) {ll ans = 1; while(b) {if(b & 1) ans = ans * a % mod; a = a * a % mod; b >>= 1;} return ans;}
int turn(char x) {return (x >= '0' && x <= '9' ? (x ^ 48) : (10 + (x - 'A')));}
void tarjan(int u, int fa) {
    low[u] = dfn[u] = ++tcnt, stk.push(u);
    for(int v : E[u]) if(!vis[u][v]) {
        if(!dfn[v]) tarjan(v, u), low[u] = min(low[u], low[v]);
        else if (!col[v]) low[u] = min(low[u], dfn[v]);
	}
    if(low[u] == dfn[u]) {cnt++; int dx; do{dx = stk.top(), stk.pop(); col[dx] = cnt;} while (dx != u);}
}
void solve() {
	scanf("%d", &n);
    for(int i = 1; i <= n; i++) E[i].clear();
    for(int i = 2, l; i <= n; i++) { l = (i - 1) / 4 + 1;
        cin>>(s + 1);
        for(int j = 1; j <= l; j++) for(int k = 4 * j - 3, x = turn(s[j]); k <= 4 * j && k < i; k++, x >>= 1) (!(x & 1) ? E[k].push_back(i) : E[i].push_back(k));
    }
    ll ans = 0;
    for(int i = 1; i <= n; i++) for(int j : E[i]) {
		tcnt = cnt = 0;
        for(int k = 1; k <= n; k++) dfn[k] = col[k] = 0; 
	    while(!stk.empty()) stk.pop();
        vis[i][j] = true, E[j].push_back(i);
        for(int k = 1; k <= n; k++) if(!dfn[k]) tarjan(k, k);
        if(i <= j) ans = (ans + qpow(2, 1ll * (j - 2) * (j - 1) / 2 + i - 1) * cnt % mod) % mod;
        else ans = (ans + qpow(2, 1ll * (i - 2) * (i - 1) / 2 + j - 1) * cnt % mod) % mod;
        vis[i][j] = false, E[j].pop_back();
    }
    printf("%lld\n", ans);
}
int main() {
    int t; cin>>t;
    while(t--) solve();
    return 0;
}