#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

template<ll MOD = 9>
class ModInt {
    ModInt constexpr inverse() const {
        return ModInt::pow(*this, 5);
    }

public:
    ll n;
    ModInt()
        : n(0) {}
    ModInt(ll _n)
        : n(((_n % MOD) + MOD) % MOD) {}
    ModInt operator+=(const ModInt &m) {
        n += m.n;
        if (n >= MOD) n -= MOD;
        return *this;
    }
    ModInt operator-=(const ModInt &m) {
        n -= m.n;
        if (n < 0) n += MOD;
        return *this;
    }
    ModInt operator*=(const ModInt &m) {
        n *= m.n;
        if (n >= MOD) n %= MOD;
        return *this;
    }
    ModInt operator/=(const ModInt &m) {
        (*this) *= m.inverse();
        return *this;
    }
    friend ModInt operator+(ModInt t, const ModInt &m) {
        return t += m;
    }
    friend ModInt operator-(ModInt t, const ModInt &m) {
        return t -= m;
    }
    friend ModInt operator*(ModInt t, const ModInt &m) {
        return t *= m;
    }
    friend ModInt operator/(ModInt t, const ModInt &m) {
        return t /= m;
    }
    ModInt operator=(const ll l) {
        n = l % MOD;
        if (n < 0) n += MOD;
        return *this;
    }
    friend ostream &operator<<(ostream &out, const ModInt &m) {
        out << m.n;
        return out;
    }
    friend istream &operator>>(istream &in, ModInt &m) {
        ll l;
        in >> l;
        m = l;
        return in;
    }
    static constexpr ModInt pow(const ModInt x, ll p) {
        ModInt<MOD> ans = 1;
        for (ModInt<MOD> m = x; p > 0; p /= 2, m *= m) {
            if (p % 2) ans *= m;
        }
        return ans;
    }
};
using mint = ModInt<>;
mint operator"" _m(unsigned long long m) {
    return mint(m);
}

class P {
public:
    mint n;
    ll modcnt;
    P()
        : n(0), modcnt(0) {}
    P(mint _n, ll m)
        : n(_n), modcnt(m) {}
    friend P operator*(P p1, const P &p2) {
        p1.n *= p2.n;
        p1.modcnt += p2.modcnt;
        return p1;
    }
    friend P operator/(P p1, const P &p2) {
        p1.n /= p2.n;
        p1.modcnt -= p2.modcnt;
        return p1;
    }
    static P convert(ll t) {
        if (t == 0) {
            return P(0, 0);
        } else {
            P p;
            while (t % 3 == 0) {
                p.modcnt++;
                t /= 3;
            }
            p.n = t;
            return p;
        }
    }
    static void print(const P &p) {
        ll ans = 0;
        if (p.modcnt >= 2) {
            ans = 0;
        } else if (p.modcnt == 1) {
            ans = (p.n * 3).n;
        } else {
            ans = p.n.n;
        }
        if (ans == 0) ans = 9;
        cout << ans << endl;
    }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin, t;
    constexpr int SZ = 100010;
    vector<P> fact(SZ, {1, 0});
    REP(i, 1, SZ) {
        fact[i] = fact[i - 1] * P::convert(i);
    }
    REP(_, 0, t) {
        string s;
        cin, s;
        int n = s.size();
        if (s == string(n, '0')) {
            cout << 0 << endl;
        } else {
            mint ans = 0;
            REP(i, 0, n) {
                P p = P::convert(s[i] - '0') * fact[n - 1] / fact[i] / fact[n - i - 1];
                ans += p.n * mint::pow(3, p.modcnt);
            }
            if (ans.n == 0) {
                cout << 9 << endl;
            } else {
                cout << ans << endl;
            }
        }
    }
    return 0;
}