def mod9(x):
    assert x > 0
    ct = 0
    while True:
        div, mod = divmod(x, 3)
        if mod != 0:
            return ct, x % 9
        x = div
        ct += 1

def solve(S: str):
    if S.count("0") == len(S):
        return 0
    T = tuple(int(s) for s in S)
    L = len(T)
    ans = T[0]
    c_pow3 = 0
    c_mod3 = 1
    c_mod9 = 1
    for i in range(1, L):
        # *= (L-i)
        ct, mod = mod9(L - i)
        c_pow3 += ct
        c_mod9 *= mod
        c_mod9 %= 9

        # /= i
        ct, mod = mod9(i)
        c_pow3 -= ct
        c_mod9 *= pow(mod, -1, 9)
        c_mod9 %= 9

        assert c_pow3 >= 0

        if c_pow3 == 0:
            ans += T[i] * c_mod9
        elif c_pow3 == 1:
            ans += T[i] * c_mod9 * 3
    ans = (ans - 1) % 9 + 1
    return ans

T = int(input())
for _ in range(T):
    print(solve(input()))