#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int qpow[25000005];
int n;
bool flg[5005][5005];
int in[5005];
int bucket[5005];
int main()
{
	int t;
	scanf("%d", &t);
	qpow[0] = 1;
	for (int i = 1; i <= 5000 * 5000; ++i) qpow[i] = 1ll * qpow[i - 1] * 2 % mod;
	while(t--)
	{
		int ans = 0;
		scanf("%d", &n);
		memset(in, 0, sizeof(in));
		for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) flg[i][j] = false;
		for (int i = 1; i <= n; ++i) for (int j = i + 1; j <= n; ++j) flg[i][j] = true, in[i]++;
		for (int i = 2; i <= n; ++i)
		{
			scanf("\n");
			for (int j = 1; j <= ceil((i - 1) / 4.0); ++j)
			{
				int l = (j - 1) * 4 + 1, r = min(n, j * 4);
				char now;
				scanf("%c", &now);
				int num;
				if(now >= '0' && now <= '9') num = now - '0';
				else num = now - 'A' + 10;
				for (int j = l; j <= r; ++j) if(num & (1 << j - l)) flg[i][j] = true, flg[j][i] = false, in[i]++, in[j]--;
			}
		}
		for (int i = 1; i <= n; ++i)
		{
			for (int j = 1; j <= n; ++j)
			{
				if(!flg[i][j]) continue;
				in[i]--, in[j]++;
				for (int k = 0; k <= n; ++k) bucket[k] = 0;
				for (int k = 1; k <= n; ++k) bucket[in[k]]++;
				int now = 0, sum = 0, num = 0;
				for (int k = 0; k <= n; ++k)
				{
					for (int l = 1; l <= bucket[k]; ++l)
					{
						++num;
						sum += k;
						now += sum == (num * (num - 1)) / 2;
					}
				}
				ans += 1ll * qpow[(max(i, j) - 2) * (max(i, j) - 1) / 2 + min(i, j) - 1] * now % mod;
				ans %= mod;
				in[i]++, in[j]--;
			}
		}
		cout << ans << endl;
	}
}