inv = [0, 1, 5, 0, 7, 2, 0, 4, 8, 0]

def solve(S, inv):
    pow3 = 0
    cum = 1
    ans = int(S[0])
    lenS = len(S)
    if lenS == 1:
        return ans
    if S == '0' * lenS:
        return 0
    num = lenS - 1
    for s in map(int, S[1:]):
        n = num
        d = lenS - n
        while not n % 3:
            pow3 += 1
            n //= 3
        while not d % 3:
            pow3 -= 1
            d //= 3
        cum = (cum * n * inv[d % 9]) % 9
        if pow3 < 2:
            ans += cum * s * 3 ** pow3
        num -= 1
    return (ans - 1) % 9 + 1

T = int(input())
for t in range(T):
    S = input()
    print(solve(S, inv))