T = int(input())
S = [input() for i in range(T)]
def dfs(s):
	if len(s) == 1:
		return s
	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):
	while len(S[i]) > 1:
		next = ''
		for j in range(len(S[i]) - 1):
			ss = int(S[i][j]) + int(S[i][j + 1])
			if ss >= 10:
				ss = ss // 10 + ss % 10
			next += str(ss)
		S[i] = next
	print(S[i])