import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

T=int(readline())
for t in range(T):
    S=list(map(int,list(readline().rstrip())))
    N=len(S)
    for _ in range(N-1):
        S=[s+ss for s,ss in zip(S[:-1],S[1:])]
        for i in range(len(S)):
            if S[i]>=10:
                S[i]=S[i]//10+S[i]%10
    ans=S[0]
    print(ans)