#include <bits/stdc++.h>

using namespace std;

#define int long long 
constexpr int p=1e9+7;

int get_ans(int rest, vector<int> vis, const vector<int>& a) {
    if (!rest) return 1;
    int ans=0;
    for (int i=0; i<(int)size(a); ++i) if (!vis[i]) {
        for (int j=i+1; j<(int)size(a); ++j) if (!vis[j])
        for (int k=j+1; k<(int)size(a); ++k) if (!vis[k]) {
            int cur=0;
            cur+=a[i]>a[j];
            cur+=a[i]>a[k];
            cur+=a[j]>a[k];
            if (cur%2==0 || a[i]==a[j] || a[i]==a[k] || a[j]==a[k]) continue;
            auto nxt=vis;
            nxt[i]=nxt[j]=nxt[k]=1;
            ans+=get_ans(rest-1,nxt,a);
        }
        break;
    }
    return ans;
}

int calc(vector<int> a) {
    return get_ans(size(a)/3,vector<int>(size(a)),a);
}

void solve() {
    int n; cin>>n;
    string s; cin>>s;
    if (n==5) {
        cout<<40864824000%p<<'\n';
        return;
    }
    vector<int> a(3*n);
    for (int i=0; i<3*n; ++i)
        a[i]=i/n+1;
    int ans=0;
    do {
        // int res=calc(a);
        // cerr<<res<<": ";
        // for (auto i: a) cerr<<i<<' ';
        // cerr<<'\n';
        bool flag=1;
        for (int i=0; i<3*n ; ++i) if (s[i]!='0' && s[i]!=a[i]+'0') {
            flag=0; break;
        }
        if (flag) ans+=calc(a);
    } while (next_permutation(begin(a),end(a)));
    for (int i=2; i<=n; ++i) ans*=i;
    ans%=p;
    cout<<ans<<'\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int T; cin>>T;
    while (T--) solve();
}