#include<iostream>
#include<cstdio>
#include<map>
#include<queue>
#define N 10000
#define mod 1000000007
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
struct reads
{
	int d[7];
};
reads delta[6],res,zero;
reads operator - (reads a,reads b)
{
	for (int i=1;i<=6;++i) a.d[i]=(a.d[i]+7-b.d[i])%7;
	return a;
}
int T,n,ans,a[N+1],dp[N+1][7][7][7],dp2[N+1][7][7][7],DP[N+1][14][14][14];
int solve(int x,reads ds)
{
	if (!x)
	{
		bool op=1;
		for (int i=1;i<=6;++i) op&=(ds.d[i]!=0);
		return op;
	}
	int res=0,rst;
	ds=ds-delta[0],x--;
	for (int i1=0,j1;i1<7;++i1)
		for (int i2=0,j2;i2<7;++i2)
			for (int i3=0,j3;i3<7;++i3)
				for (int k=0;k<8;++k)
				{
					rst=1;
					if (!(k&1)) j1=7+(ds.d[1]+7-i1)%7;
					else
					{
						if ((i1<<1)%7==(ds.d[1]+ds.d[6])%7) continue;
						j1=(i1+7-ds.d[6])%7,rst=MD2(-rst);
					}
					if (!((k>>1)&1)) j2=7+(ds.d[2]+7-i2)%7;
					else
					{
						if ((i2<<1)%7==(ds.d[2]+ds.d[5])%7) continue;
						j2=(i2+7-ds.d[5])%7,rst=MD2(-rst);
					}
					if (!(k>>2)) j3=7+(ds.d[3]+7-i3)%7;
					else
					{
						if ((i3<<1)%7==(ds.d[3]+ds.d[4])%7) continue;
						j3=(i3+7-ds.d[4])%7,rst=MD2(-rst);
					}
					Adder(res,1ll*dp[x][i1][i2][i3]*DP[x][j1][j2][j3]%mod*rst%mod);
				}
	return res;
}
int main()
{
	reads ds;
	string s;
	for (int i=1;i<=6;++i)
		for (int j=0,res=1;j<=5;++j,res=1ll*res*i%7)
			delta[j].d[i]=res;
	dp[0][0][0][0]=dp2[0][0][0][0]=1;
	for (int i=0;i<=N;++i)
	{
		if (i)
		{
			ds=delta[i%6];
			for (int j1=0;j1<7;++j1)
				for (int j2=0;j2<7;++j2)
					for (int j3=0;j3<7;++j3)
						dp[i][j1][j2][j3]=dp[i-1][j1][j2][j3],dp2[i][j1][j2][j3]=dp2[i-1][j1][j2][j3];
			if (!((i%6)&1))
			{
				for (int j1=0;j1<7;++j1)
					for (int j2=0;j2<7;++j2)
						for (int j3=0;j3<7;++j3)
							Adder(dp[i][(j1+ds.d[1])%7][(j2+ds.d[2])%7][(j3+ds.d[3])%7],dp[i-1][j1][j2][j3]);
			}
			else
			{
				for (int j1=0;j1<7;++j1)
					for (int j2=0;j2<7;++j2)
						for (int j3=0;j3<7;++j3)
							Adder(dp2[i][(j1+ds.d[1])%7][(j2+ds.d[2])%7][(j3+ds.d[3])%7],dp2[i-1][j1][j2][j3]);
			}
		}
		for (int j1=0;j1<7;++j1)
			for (int j2=0;j2<7;++j2)
				for (int j3=0;j3<7;++j3)
					DP[i][j1][j2][j3]=dp2[i][j1][j2][j3];
		for (int j1=0;j1<7;++j1)
			for (int j2=0;j2<7;++j2)
				for (int j3=0;j3<7;++j3)
					for (int k=0;k<7;++k)
						if (j1!=k)
							Adder(DP[i][7+k][j2][j3],DP[i][j1][j2][j3]);
		for (int j1=0;j1<14;++j1)
			for (int j2=0;j2<7;++j2)
				for (int j3=0;j3<7;++j3)
					for (int k=0;k<7;++k)
						if (j2!=k)
							Adder(DP[i][j1][7+k][j3],DP[i][j1][j2][j3]);
		for (int j1=0;j1<14;++j1)
			for (int j2=0;j2<14;++j2)
				for (int j3=0;j3<7;++j3)
					for (int k=0;k<7;++k)
						if (j3!=k)
							Adder(DP[i][j1][j2][7+k],DP[i][j1][j2][j3]);
	}
	T=read();
	while (T--)
	{
		cin>>s,n=s.length(),ans=0,res=zero;
		for (int i=1;i<=n;++i)
		{
			if (s[i-1]=='1')
			{
				if (i!=n)
				{
					a[i]=0,Adder(ans,solve(n-i,res));
					a[i]=1,res=res-delta[(n-i)%6];
				}
				else a[i]=1,res=res-delta[(n-i)%6],Adder(ans,solve(n-i,res));
			}
			else a[i]=0;
		}
		printf("%d\n",ans);
	}
	return 0;
}