#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using i64 = long long;

constexpr int P = 1000000007;
constexpr int L = 10000;

int pw[7][6] {};

std::array<int, 7 * 7 * 7> dp[1 << 6];

int fac[L + 1], invfac[L + 1];
int sumbinom[L + 1][7];

int binom(int n, int m) {
    return 1LL * fac[n] * invfac[m] % P * invfac[n - m] % P;
}

int power(int a, int b) {
    int res = 1;
    for (; b; b /= 2, a = 1LL * a * a % P) {
        if (b % 2) {
            res = 1LL * res * a % P;
        }
    }
    return res;
}

int solve[7 * 7 * 7 * 7 * 7 * 7];
int p7[7] = {1, 7, 49, 343, 343 * 7, 343 * 49, 343 * 343};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    for (int i = 0; i < 7; i++) {
        pw[i][0] = 1;
        for (int j = 1; j < 6; j++) {
            pw[i][j] = i * pw[i][j - 1] % 7;
        }
    }

    fac[0] = 1;
    for (int i = 1; i <= L; i++) {
        fac[i] = 1LL * fac[i - 1] * i % P;
    }
    invfac[L] = power(fac[L], P - 2);
    for (int i = L; i; i--) {
        invfac[i - 1] = 1LL * invfac[i] * i % P;
    }

    sumbinom[0][0] = 1;
    for (int i = 1; i <= L; i++) {
        for (int j = 0; j < 7; j++) {
            sumbinom[i][j] = (sumbinom[i - 1][j] + sumbinom[i - 1][(j + 6) % 7]) % P;
        }
    }
    
    int T;
    std::cin >> T;

    std::vector<std::string> s(T);
    for (int i = 0; i < T; i++) {
        std::cin >> s[i];
        std::reverse(s[i].begin(), s[i].end());
        s[i].resize(L, '0');
    }

    std::vector pre(T, std::vector(L + 1, std::array<int, 7>{}));
    for (int i = 0; i < T; i++) {
        for (int j = 0; j < L; j++) {
            for (int k = 1; k < 7; k++) {
                pre[i][j + 1][k] = (pre[i][j][k] + (s[i][j] - '0') * pw[k][j % 6]) % 7;
            }
        }
    }

    auto dfs = [&](auto self, int i, int a, int b) -> void {
        if (i == 6) {
            solve[b] = a;
            return;
        }
        for (int x = 0; x < 7; x++) {
            int nb = 0;
            for (int j = 0; j < 6; j++) {
                int old = b / p7[j] % 7;
                int ne = (old + x * pw[j + 1][i]) % 7;
                nb += ne * p7[j];
            }
            self(self, i + 1, a + p7[i] * x, nb);
        }
    };
    dfs(dfs, 0, 0, 0);

    std::vector<int> ans(T);

    for (int s = 0; s < (1 << 6); s++) {
        dp[s][0] = 1;
    }
    for (int i = 1; i < L; i++) {
        int tmp[6][7] {};
        for (int x = 0; x < 6; x++) {
            for (int y = 0; y < 7; y++) {
                int cnt = i / 6 + (x < i % 6) - (x == 0);
                tmp[x][y] = sumbinom[cnt][y];
            }
        }
        for (int j = 0; j < T; j++) {
            if (s[j][i] == '1') {
                std::array<int, 7> f{};
                for (int x = 1; x < 7; x++) {
                    f[x] = (pre[j][L][x] - pre[j][i + 1][x] + 7 + 1) % 7;
                    f[x] = (7 - f[x]) % 7;
                }
                for (int mask = 0; mask < (1 << 6); mask++) {
                    if (__builtin_popcount(mask) <= 3) {
                        int T = mask;
                        while (__builtin_popcount(T) < 3) {
                            T |= T + 1;
                        }
                        int S = T;
                        int x = __builtin_ctz(T);
                        T ^= 1 << x;
                        int y = __builtin_ctz(T);
                        T ^= 1 << y;
                        int z = __builtin_ctz(T);
                        int fx = mask >> x & 1;
                        int fy = mask >> y & 1;
                        int fz = mask >> z & 1;
                        // if (mask == 0) {
                        //     std::cerr << x << " " << y << " " << z << "\n";
                        // }
                        for (int a = fx ? f[x + 1] : 0; a <= (fx ? f[x + 1] : 6); a++) {
                            for (int b = fy ? f[y + 1] : 0; b <= (fy ? f[y + 1] : 6); b++) {
                                for (int c = fz ? f[z + 1] : 0; c <= (fz ? f[z + 1] : 6); c++) {
                                    int coef = __builtin_popcount(mask) % 2 ? P - 1 : 1;
                                    ans[j] = (ans[j] + 1LL * coef * dp[S][a + b * 7 + c * 49]) % P;
                                    // if (dp[S][a + b * 7 + c * 49] != 0)
                                    // std::cerr << mask << " " << dp[S][a + b * 7 + c * 49] << " " << a << " " << b << " " << c << "\n";
                                }
                            }
                        }
                    } else {
                        int len = i;
                        int res = 0;
                        auto dfs = [&](auto self, int i, int b) -> void {
                            if (i == 6) {
                                int a = solve[b];
                                int ways = 1;
                                for (int j = 0; j < 6; j++) {
                                    int t = a % 7;
                                    a /= 7;
                                    ways = 1ULL * ways * tmp[j][t] % P;
                                }
                                int coef = __builtin_popcount(mask) % 2 ? P - 1 : 1;
                                res = (res + 1LL * coef * ways) % P;
                                // if (mask == 63) {
                                //     std::cerr << "len : " << len << ", b : " << b << ", a : " << a << ", ways : " << ways << "\n";
                                //     for (int j = 1; j < 7; j++) {
                                //         std::cerr << f[j] << " ";
                                //     }
                                //     std::cerr << "\n";
                                // }
                                // if (ways != 0) {
                                //     std::cerr << ways << " " << j << " " << len << " " << mask << "\n";
                                // }
                                return;
                            }
                            for (int x = (mask >> i & 1) ? f[i + 1] : 0; x <= ((mask >> i & 1) ? f[i + 1] : 6); x++) {
                                self(self, i + 1, b + x * p7[i]);
                            }
                        };
                        dfs(dfs, 0, 0);
                        ans[j] = (ans[j] + res) % P;
                    }
                }
            }
        }
        for (int x = 0; x < 6; x++) {
            for (int y = x + 1; y < 6; y++) {
                for (int z = y + 1; z < 6; z++) {
                    int s = 1 << x | 1 << y | 1 << z;

                    auto g = dp[s];
                    for (int a = 0; a < 7; a++) {
                        for (int b = 0; b < 7; b++) {
                            for (int c = 0; c < 7; c++) {
                                int na = (a + pw[x + 1][i % 6]) % 7;
                                int nb = (b + pw[y + 1][i % 6]) % 7;
                                int nc = (c + pw[z + 1][i % 6]) % 7;
                                int T = a + b * 7 + c * 49;
                                int nT = na + nb * 7 + nc * 49;
                                g[nT] += dp[s][T];
                                if (g[nT] >= P) {
                                    g[nT] -= P;
                                }
                            }
                        }
                    }
                    std::swap(dp[s], g);
                }
            }
        }
    }

    for (int i = 0; i < T; i++) {
        if (s[i][0] == '1') {
            std::array<int, 7> f{};
            for (int j = 0; j < L; j++) {
                for (int x = 1; x < 7; x++) {
                    f[x] = (f[x] + pw[x][j % 6] * (s[i][j] - '0')) % 7;
                }
            }
            int ok = 1;
            for (int x = 1; x < 7; x++) {
                if (f[x] == 0) {
                    ok = 0;
                }
            }
            ans[i] = (ans[i] + ok) % P;
        }
        std::cout << ans[i] << "\n";
    }

    return 0;
}