#include <iostream>
#include <vector>
#include <tuple>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < (n); ++(i))
using namespace std;
template <class T> void setmax(T & a, T const & b) { if (a < b) a = b; }
template <typename T, typename X> auto vectors(T a, X x) { return vector<T>(x, a); }
template <typename T, typename X, typename Y, typename... Zs> auto vectors(T a, X x, Y y, Zs... zs) { auto cont = vectors(a, y, zs...); return vector<decltype(cont)>(x, cont); }
pair<int,int> zero(int k) {
    int z = 0;
    while (k % 3 == 0) { k /= 3; z += 1; }
    return { k, z };
}
const int inv[9] = { 0, 1, 5, 0, 7, 2, 0, 4, 8 };
int choose(int n, int r) {
    const int mod = 9;
    static vector<pair<int,int> > fact(1, make_pair(1, 0));
    if (fact.size() <= n) {
        int l = fact.size();
        fact.resize( n + 1);
        repeat_from (i,l,n+1) {
            int pk, pz; tie(pk, pz) = fact[i-1];
            int k, z; tie(k, z) = zero(i);
            fact[i] = { pk * k % 9, pz + z };
        }
    }
    r = min(r, n - r);
    int pk, pz; tie(pk, pz) = fact[n];
    int qk, qz; tie(qk, qz) = fact[r];
    int rk, rz; tie(rk, rz) = fact[n-r];
    int p = pk * inv[qk] * inv[rk] % 9;
    int z = pz - qz - rz;
    assert (z >= 0);
    return z == 0 ? p : z == 1 ? p * 3 % 9 : 0;
}
int main() {
    int t; cin >> t;
    while (t --) {
        string s; cin >> s;
        int n = s.length();
        int acc = 0;
        repeat (j,n) acc += (s[j] - '0') * choose(n-1, j);
        while (acc >= 10) acc = acc / 10 + acc % 10;
        cout << acc << endl;
    }
    return 0;
}