T = int(input())
S = [input() for i in range(T)]
def dfs(s):
	if len(s) == 1:
		return s[0]
	next = ''
	for i in range(len(s) - 1):
		ss = int(s[i]) + int(s[i + 1])
		if ss >= 10:
			ss = ss // 10 + ss % 10
		next += str(ss)
	return dfs(next)
for i in range(T):
	if len(S[i]) == 1:
		print(S[i])
		continue
	else:
		print(dfs(S[i]))