#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6+10;
const int mod = 1e9+7;
int main(){
    ios::sync_with_stdio(false);
    string s;
    while(cin>>s){
        string t;
        t.clear();
        int tot = 0;
        while(s.length()!=0){
            t.clear();
            for(int i=0; i<s.length(); i++){
                if(s[i] == '0') t+=s[i];
                else if(s[i] == '1') t+=s[i], t+='0';
                else t+=s[i], t+='1';
            }
            tot++;
            t = t.substr(1, t.length());
            cout<<s<<" "<<t<<endl;
            s = t;
        }
        cout<<tot<<endl;
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
typedef long long ll;
const int modd = 1e9+7;
map<ll, ll> mp;
char s[maxn];
ll euler(ll x){
    if(mp.count(x)) return mp[x];
    ll ans = x;
    ll temp = x;
    for(int i=2; i*i<=x; i++){
        if(x%i ==0){
            ans -= ans/i;
            while(x%i == 0){
                x /= i;
            }
        }
    }
    if(x>1){
        ans -= ans/x;
    }
    mp[temp] = ans;
    return ans;
}
 
ll pow_mod(ll a, ll b, ll c){
    ll ans = 1;
    while(b){
        if(b&1) ans = ans*a%c;
        a = a*a%c;
        b>>=1;
    }
    return ans;
}
 
ll dfs(ll x, ll mod){
    if(x<0 || mod == 1) return 0;
    //cout<<s[x]<<" "<<x<<" "<<mod<<endl;
    if(s[x] == '0'){
        return (dfs(x-1, mod)+1ll)%mod;
    }
    else if(s[x] == '1'){
        return (2ll*dfs(x-1, mod)+2ll)%mod;
    }
    else if(s[x] == '2') {
        return (6ll*pow_mod(2, (dfs(x-1, euler(mod))+euler(mod))%euler(mod), mod)%mod-3ll+mod)%mod;
    }
    return 0;
}
 
int main(){
    ios::sync_with_stdio(false);
    //cout<<euler1(1e9+7)<<endl;
    int t;
    scanf("%d", &t);
    ll mi;
    mp.clear();
    while(t--){
        scanf("%s", s);
        printf("%lld\n", dfs(strlen(s)-1, 1e9+7));
    }
    return 0;
}