#line 1 "C.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")

#line 2 "/mnt/c/Users/tsigm/Documents/Cprogram/library/template.hpp"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}

/*
x       0  1  2  3  4  5  6  7  8  9
bsr(x) -1  0  1  1  2  2  2  2  3  3
最上位bit
*/
int bsr(int x){
	return x == 0 ? -1 : 31 ^ __builtin_clz(x);
}
int bsr(uint x){
	return x == 0 ? -1 : 31 ^ __builtin_clz(x);
}
int bsr(ll x){
	return x == 0 ? -1 : 63 ^ __builtin_clzll(x);
}
int bsr(ull x){
	return x == 0 ? -1 : 63 ^ __builtin_clzll(x);
}

/*
x       0  1  2  3  4  5  6  7  8  9
bsl(x) -1  0  1  0  2  0  1  0  3  0
最下位bit
*/
int bsl(int x){
	if(x==0) return -1;
	return __builtin_ctz(x);
}
int bsl(uint x){
	if(x==0) return -1;
	return __builtin_ctz(x);
}
int bsl(ll x){
	if(x==0) return -1;
	return __builtin_ctzll(x);
}
int bsl(ull x){
	if(x==0) return -1;
	return __builtin_ctzll(x);
}


template<class T>
T rnd(T l,T r){	//[l,r)
	using D = uniform_int_distribution<T>;
	static random_device rd;
	static mt19937 gen(rd());
	return D(l,r-1)(gen);
}
template<class T>
T rnd(T n){	//[0,n)
	return rnd(T(0),n);
}
#line 5 "C.cpp"
template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll _v):v(normS(_v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ModInt& operator++(int){ return *this=*this+1;}
	ModInt& operator--(int){ return *this=*this-1;}
	template<class T> friend ModInt operator+(T a, const ModInt& b){ return (ModInt(a) += b);}
	template<class T> friend ModInt operator-(T a, const ModInt& b){ return (ModInt(a) -= b);}
	template<class T> friend ModInt operator*(T a, const ModInt& b){ return (ModInt(a) *= b);}
	template<class T> friend ModInt operator/(T a, const ModInt& b){ return (ModInt(a) /= b);}
	ModInt pow(ll p) const {
		if(p<0) return inv().pow(-p);
		ModInt a = 1;
		ModInt x = *this;
		while(p){
			if(p&1) a *= x;
			x *= x;
			p >>= 1;
		}
		return a;
	}
	ModInt inv() const {		// should be prime
		return pow(mod-2);
	}
	// ll extgcd(ll a,ll b,ll &x,ll &y) const{
	// 	ll p[]={a,1,0},q[]={b,0,1};
	// 	while(*q){
	// 		ll t=*p/ *q;
	// 		rep(i,3) swap(p[i]-=t*q[i],q[i]);
	// 	}
	// 	if(p[0]<0) rep(i,3) p[i]=-p[i];
	// 	x=p[1],y=p[2];
	// 	return p[0];
	// }
	// ModInt inv() const {
	// 	ll x,y;
	// 	extgcd(v,mod,x,y);
	// 	return make(normS(x+mod));
	// }

	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	bool operator<(const ModInt& b) const { return v<b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<1000000007>;

V<mint> fact,ifact,invs;
// a,b >= 0 のみ
mint Choose(int a,int b){
	if(b<0 || a<b) return 0;
	return fact[a] * ifact[b] * ifact[a-b];
}

/*
// b >= 0 の範囲で、 Choose(a,b) = a(a-1)..(a-b+1) / b!
mint Choose(int a,int b){
	if(b<0 || a<b) return 0;
	return fact[a] * ifact[b] * ifact[a-b];
}
*/

void InitFact(int N){	//[0,N]
	N++;
	fact.resize(N);
	ifact.resize(N);
	invs.resize(N);
	fact[0] = 1;
	rep1(i,N-1) fact[i] = fact[i-1] * i;
	ifact[N-1] = fact[N-1].inv();
	for(int i=N-2;i>=0;i--) ifact[i] = ifact[i+1] * (i+1);
	rep1(i,N-1) invs[i] = fact[i-1] * ifact[i];
}

mint solve(string s){
	int N = si(s);
	reverse(all(s));
	if(s[0] == '1'){
		bool done = false;
		rep(i,N){
			if(s[i] == '0'){
				s[i] = '1'; done = true; break;
			}
			s[i] = '0';
		}
		if(!done){
			s += '1';
			N++;
		}
	}
	show(s);
	// s = 001101010001
	// x = 1****0010001
	// p0 = 1s0+1s2+1s4, p1 = 1s1+1s3+1s5
	// q0 = 1s0+4s2+2s4, q1 = 2s1+1s3+4s5
	// r0 = 1s0+2s2+4s4, r1 = 3s1+6s3+5s5
	// off[i] += A[i][j] * s_j

	VV<int> A = {
		{1,0,1,0,1,0},
		{0,1,0,1,0,1},
		{1,0,4,0,2,0},
		{0,2,0,1,0,4},
		{1,0,2,0,4,0},
		{0,3,0,6,0,5}
	};
	V<int> off(6);
	rep(j,N) if(j == 0 || s[j] == '1'){
		rep(i,6) off[i] += A[i][j%6];
	}
	rep(i,6) off[i] %= 7;
	auto dp0 = Vec<mint>(7,7,7);
	auto dp1 = Vec<mint>(8,8,8);	// 7:*
	auto buf = Vec<mint>(7,7,7);
	dp0[0][0][0] = dp1[0][0][0] = 1;
	mint ans = 0;
	rep1(j,N-1){
		if(s[j] == '1'){
			show("--------------"); show(j);
			rep(i,6) off[i] = (off[i]-A[i][j%6]+7)%7;
			show(off);
			{
				// dp1 accumulate
				rep(p,8) rep(q,8) rep(r,8) if(p==7 or q==7 or r==7) dp1[p][q][r] = 0;
				rep(p,7) rep(q,7) rep(r,7){
					dp1[p][q][7] -= dp1[p][q][r];
					dp1[p][7][r] -= dp1[p][q][r];
					dp1[p][7][7] += dp1[p][q][r];
					dp1[7][q][r] -= dp1[p][q][r];
					dp1[7][q][7] += dp1[p][q][r];
					dp1[7][7][r] += dp1[p][q][r];
					dp1[7][7][7] -= dp1[p][q][r];
				}
			}
			// x[0] = 1
			// x[1,j-1] = *
			// x[j] = 0
			// x[j+1..] = s[j+1..]
			VV<int> pbads(7);
			rep(p0,7){
				rep(p1,7){
					if((p0+off[0] + p1+off[1])%7 == 0 or
					   (p0+off[0] - p1-off[1])%7 == 0) pbads[p0].pb(p1);
				}
				pbads[p0].pb(7);
			}
			VV<int> qbads(7);
			rep(q0,7){
				rep(q1,7){
					if((q0+off[2] + q1+off[3])%7 == 0 or
					   (q0+off[2] - q1-off[3])%7 == 0) qbads[q0].pb(q1);
				}
				qbads[q0].pb(7);
			}
			VV<int> rbads(7);
			rep(r0,7){
				rep(r1,7){
					if((r0+off[4] + r1+off[5])%7 == 0 or
					   (r0+off[4] - r1-off[5])%7 == 0) rbads[r0].pb(r1);
				}
				rbads[r0].pb(7);
			}

			rep(p0,7) rep(q0,7) rep(r0,7){
				mint tmp = 0;
				for(int p1: pbads[p0]) for(int q1: qbads[q0]) for(int r1: rbads[r0]){
					tmp -= dp1[p1][q1][r1];
				}
				ans += dp0[p0][q0][r0] * tmp;
				// rep(p1,7) rep(q1,7) rep(r1,7){
				// 	if(binary_search(all(pbads[p0]),p1)) continue;
				// 	if(binary_search(all(qbads[q0]),q1)) continue;
				// 	if(binary_search(all(rbads[r0]),r1)) continue;
				// 	ans += dp0[p0][q0][r0] * dp1[p1][q1][r1];
				// }
			}
		}
		// j -> *
		if(j%2 == 0){
			buf = dp0;
			rep(p,7) rep(q,7) rep(r,7) dp0[(p+A[0][j%6])%7][(q+A[2][j%6])%7][(r+A[4][j%6])%7] += buf[p][q][r];
		}else{
			buf = dp1;
			rep(p,7) rep(q,7) rep(r,7) dp1[(p+A[1][j%6])%7][(q+A[3][j%6])%7][(r+A[5][j%6])%7] += buf[p][q][r];
		}
	}
	return ans;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int T; cin >> T;
	while(T--){
		string s; cin >> s;
		cout << solve(s) << endl;
	}
}