def solve():
	N = input()
	n = int(N)
	pow10 = 1
	for i in range(1, 1 << 30):
		m = n * i
		while pow10 <= m:
			pow10 *= 10 
		if (pow10 + i) % (i + 1) == 0:
			print(m)
			assert int(str(n) + str(m)) % (n + m) == 0
			return
		
T = int(input())
for _ in range(T):
	solve()