#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = (int)1e6 + 12, MOD = (int)1e9 + 7;

int n, a[N];

map<vector<int>, int> dp[N];
bool check(int l, int r) {
    if(l + 1 == r) {
        if(abs(a[r] - a[l]) == 1 || abs(a[r] - a[l]) == 3) return true;
        return false;
    }
    vector<int> f;
    for(int i = l; i <= r; i++) {        
        f.push_back(a[i]);
    }
    sort(f.begin(), f.end());
    if(f[1] - f[0] == 1 && f[3] - f[2] == 1 && f[2] - f[1] == 2) {
        return true;
    }
    return false;
}
bool ok(vector<int> f) {
    sort(f.begin(), f.end());
    if((int)f.size() == 2) {
        return (f[1] - f[0] == 1 || f[1] - f[0] == 3);
    }
    if(f[1] - f[0] == 1 && f[3] - f[2] == 1 && f[2] - f[1] == 2) {
        return true;
    }
    return false;
}
void add(int &x, int y) {
    x += y;
    if(x >= MOD) x -= MOD;
}
void test() {
    string s;
    cin >> s;

    n = (int)s.size();
    for(int i = 1; i <= n; i++) {
        a[i] = (s[i - 1] - '0');
        dp[i].clear();
    }
    dp[1][{a[1]}] = 1;
    int res = 0;
    for(int i = 2; i <= n; i++) {
        for(auto [r, y]:dp[i - 1]) {
            vector<int> v = r;
            v.push_back(a[i]);
            if(ok(v)) {
                vector<int> tt;
                for(int j = i - 1; j >= i - (int)v.size() + 1; j--) {
                    tt.push_back(a[j]);
                }
                reverse(tt.begin(), tt.end());
                tt.push_back(a[i]);
                if(tt == v) {
                    sort(tt.begin(), tt.end());
                    sort(v.begin(), v.end());
                    do{
                        int j = v.back();
                        v.pop_back();
                        add(dp[i][v], y);
                        v.push_back(j);
                    }while(next_permutation(v.begin(), v.end()));
                } else {
                    reverse(v.begin(), v.end());
                    v.pop_back();
                    reverse(v.begin(), v.end());
                    add(dp[i][v], y);    
                }
            } else {
                reverse(v.begin(), v.end());
                v.pop_back();
                reverse(v.begin(), v.end());
                add(dp[i][v], y);
            }
        }
    }
    // for(int i = 1; i <= n; i++) {
    //     cout << i << "A\n";
    //     for(auto [r, y]:dp[i]) {
    //         for(int j:r) {
    //             cout << j << ' ';
    //         }
    //         cout << "| " << y << '\n';
    //     }
    //     cout << '\n';
    // }
    for(auto [r, y]:dp[n]) {
        if((int)r.size() == 3) continue;
        add(res, y);
    }
    cout << res << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    cin >> t;

    while(t--) 
        test();
}