#include <bits/stdc++.h>
using namespace std;
constexpr int N = 5010, Mod = 1e9 + 7;
int n, pw2[N * N / 2], outdeg[N], d[N], pre1[N], pre2[N];
int pre3[N];
pair<int, int> interval[N];
bool e[N][N];
int main() {
    pw2[0] = 1;
    for (int i = 1; i < N * N / 2; ++i)
        pw2[i] = (pw2[i - 1] + pw2[i - 1]) % Mod;
    int T;
    cin >> T;
    while (T--) {
        cin >> n;
        fill(outdeg + 1, outdeg + n + 1, 0);
        for (int i = 1; i <= n; ++i)
            fill(e[i] + 1, e[i] + n + 1, false);
        for (int i = 2; i <= n; ++i) {
            string str;
            cin >> str;
            for (int l = 1, r; l < i; l += 4) {
                r = min(l + 3, i - 1);
                int res = str[(l - 1) >> 2] <= '9' ? str[(l - 1) >> 2] & 15 : str[(l - 1) >> 2] - 'A' + 10;
                for (int j = l; j <= r; ++j) {
                    if (res >> (j - l) & 1) {
                        e[i][j] = true;
                        ++outdeg[i];
                    } else {
                        e[j][i] = true;
                        ++outdeg[j];
                    }
                }
            }
        }
        copy(outdeg + 1, outdeg + n + 1, d + 1);
        sort(d + 1, d + n + 1);
        for (int l = 1, r; l <= n; l = r) {
            r = l + 1;
            while (r <= n && d[r] == d[l])
                ++r;
            interval[d[l]] = {l, r - 1};
        }
        for (int i = 1, sum = 0; i <= n; ++i) {
            sum += d[i];
            pre1[i] = pre1[i - 1] + (sum == i * (i - 1) / 2);
            pre2[i] = pre2[i - 1] + (sum + 1 == i * (i - 1) / 2);
            pre3[i] = pre3[i - 1] + (sum - 1 == i * (i - 1) / 2);
        }
        int ans = 0;
        for (int i = 1; i <= n; ++i)
            for (int j = i + 1; j <= n; ++j) {
                int x = interval[outdeg[e[i][j] ? j : i]].second, y = interval[outdeg[e[i][j] ? i : j]].first;

                if (x + 1 == y && d[x] + 1 == d[y]) {
                    ans = (ans + 1ll * pre1[n] * pw2[(j - 1) * (j - 2) / 2 + i - 1]) % Mod;
                    continue;
                }

                if (x > y)
                    swap(x, y);

                ans = (ans + 1ll * (pre1[x - 1] + pre1[n] - pre1[y - 1] + pre2[y - 1] - pre2[x - 1]) * 
                        pw2[(j - 1) * (j - 2) / 2 + i - 1]) % Mod;
            }
        cout << ans << "\n";
    }
    return 0;
}