#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], 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();
    dp[0] = dp[1] = 1;
    for(int i = 1; i <= n; i++) {
        a[i] = (s[i - 1] - '0');
    }
    for(int i = 2; i <= n; i++) {
        dp[i] = dp[i - 1];
        if(check(i - 1, i)) {
            add(dp[i], dp[i - 2]);            
        }
    }
    cout << dp[n] << '\n';
}

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

    int t = 1;
    cin >> t;

    while(t--) 
        test();
}