#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=1e4,Mod=1e9+7;

int f[Maxn+5][7][7][7],g[Maxn+5][2][7][7][7];
int sf[Maxn+5][8][8][8],sg[Maxn+5][8][8][8];
int n,ans,pw[8][Maxn+5],a[Maxn+5];

inline void Init()
{
    For(i,0,7) {pw[i][0]=1; For(j,1,Maxn) pw[i][j]=pw[i][j-1]*i%7;}
    g[0][0][0][0][0]=f[0][0][0][0]=1,g[1][1][1][1][1]=f[1][1][1][1]=1;
    For(i,2,Maxn)
    {
        For(a,0,6) For(b,0,6) For(c,0,6) if(f[i-2][a][b][c]) For(j,0,1)
            (g[i][j][(a+pw[1][i-1]*j)%7][(b+pw[2][i-1]*j)%7][(c+pw[3][i-1]*j)%7]+=f[i-2][a][b][c])%=Mod;
        For(a,0,6) For(b,0,6) For(c,0,6) f[i][a][b][c]=(g[i][0][a][b][c]+g[i][1][a][b][c])%Mod;
    }
    For(i,0,Maxn)
    {
        For(a,0,6) For(b,0,6) For(c,0,6) sf[i][a][b][c]=f[i][a][b][c],sg[i][a][b][c]=g[i][0][a][b][c];
        For(a,0,6) For(b,0,7) For(c,0,7) (sf[i][7][b][c]+=sf[i][a][b][c])%=Mod,(sg[i][7][b][c]+=sg[i][a][b][c])%=Mod;
        For(a,0,7) For(b,0,6) For(c,0,7) (sf[i][a][7][c]+=sf[i][a][b][c])%=Mod,(sg[i][a][7][c]+=sg[i][a][b][c])%=Mod;
        For(a,0,7) For(b,0,7) For(c,0,6) (sf[i][a][b][7]+=sf[i][a][b][c])%=Mod,(sg[i][a][b][7]+=sg[i][a][b][c])%=Mod;
    }
}

vector<int> ban[4]; int val[4],h[8][8][8];
inline void Solve()
{
    string ch; cin>>ch; n=ch.size();
    For(i,0,n-1) a[n-i]=ch[i]-'0'; ans=0;
    for(int i=n,a1=0,a2=0,a3=0,a4=0,a5=0,a6=0;i>=1;--i)
    {
        if(a[i]==1)
        {
            if(i&1) memcpy(h,sf[i-1],sizeof(h)); else memcpy(h,sg[i],sizeof(h));
            For(b1,0,6) For(b2,0,6) For(b3,0,6)
            {
                int res;
                if(i&1) res=g[i][0][b1][b2][b3]; else res=f[i-1][b1][b2][b3];
                if(!res) continue;
                For(j,1,3) vector<int>().swap(ban[j]);
                ban[1].push_back((14-a1-b1)%7),ban[1].push_back((a6+b1)%7);
                ban[2].push_back((14-a2-b2)%7),ban[2].push_back((a5+b2)%7);
                ban[3].push_back((14-a3-b3)%7),ban[3].push_back((a4+b3)%7);
                For(j,1,3) if(ban[j].size()==2 && ban[j].front()==ban[j].back()) ban[j].pop_back();
                For(x,0,ban[1].size())
                {
                    val[1]=(x==ban[1].size()?7:ban[1][x]);
                    For(y,0,ban[2].size())
                    {
                        val[2]=(y==ban[2].size()?7:ban[2][y]);
                        For(z,0,ban[3].size())
                        {
                            val[3]=(z==ban[3].size()?7:ban[3][z]);
                            if((val[1]!=7)+(val[2]!=7)+(val[3]!=7)&1) ans=(ans-1ll*res*h[val[1]][val[2]][val[3]]%Mod+Mod)%Mod;
                            else ans=(ans+1ll*res*h[val[1]][val[2]][val[3]])%Mod;
                        }
                    }
                }
            }
        }
        a1=(a1+pw[1][i-1]*a[i])%7,a2=(a2+pw[2][i-1]*a[i])%7,a3=(a3+pw[3][i-1]*a[i])%7;
        a4=(a4+pw[4][i-1]*a[i])%7,a5=(a5+pw[5][i-1]*a[i])%7,a6=(a6+pw[6][i-1]*a[i])%7;
        if(i==1 && a1 && a2 && a3 && a4 && a5 && a6 && a[1]) ans=(ans+1)%Mod;
    } printf("%d\n",ans);
}

int main()
{
    // freopen("1.in","r",stdin);

    Init(); int T; cin>>T;
    while(T--) Solve();
    return 0;
}