#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;
using P = pair<int, 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

class Eratosthenes {
    vector<int> plist;

public:
    Eratosthenes(int sz)
        : plist(sz, -1) {
        for (int i = 2; i < sz; i++) {
            if (plist[i] == -1) {
                plist[i] = i;
                for (int j = i; j < sz; j += i) {
                    if (plist[j] == -1) {
                        plist[j] = i;
                    }
                }
            }
        }
    }
    bool isPrime(int n) {
        return plist[n] == n;
    }
    vector<int> factor(int n) {
        vector<int> res;
        while (n > 1) {
            res.push_back(plist[n]);
            n /= plist[n];
        }
        return res;
    }
};

const int mod = 9;
int pow(int x, int p) {
    if (p == 0) {
        return 1;
    } else if (p % 2) {
        return (x * pow(x, p - 1)) % mod;
    } else {
        int res = pow(x, p / 2);
        return (res * res) % mod;
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin, t;
    int SZ = 100010;
    Eratosthenes sieve(SZ);

    auto dp = make_v(SZ, mod, 0LL);
    REP(i, 2, SZ) {
        auto t = sieve.factor(i);
        for (auto v : t) {
            dp[i][v % mod]++;
        }
        REP(j, 0, mod) {
            dp[i][j] += dp[i - 1][j];
        }
    }
    auto nCr = [&](int n, int r) {
        int ans = 1;
        REP(i, 0, mod) {
            int cnt = dp[n][i] - dp[n - r][i] - dp[r][i];
            ans = (ans * pow(i, cnt)) % mod;
        }
        return ans;
    };
    REP(_, 0, t) {
        string s;
        cin, s;
        int n = s.size();
        if (s == string(n, '0')) {
            cout << 0 << endl;
        } else {
            int ans = 0;
            REP(i, 0, n) {
                ans = (ans + (s[i] - '0') * nCr(n - 1, i)) % mod;
            }
            if (ans == 0) {
                ans = 9;
            }
            cout << ans << endl;
        }
    }
    return 0;
}