def next_palindrome(n):
if set(n) == {'9'}:
return str(int(n)+2)
else:
if len(n)%2 == 1:
center = len(n)//2
middle = n[center]
left = n[:center]
right = n[center+1:]
m = int(left)
if middle == '9':
return str(m+1)+ '0' +str(m+1)[::-1]
else:
if int(left[::-1]) > int(right):
return left + str(int(middle)) + left[::-1]
else:
return left + str(int(middle)+1) + left[::-1]
else:
left = n[:len(n)//2]
right = n[(len(n)//2):]
if int(left[::-1]) > int(right):
return left + left[::-1]
else:
left = str(int(left)+1)
return left + left[::-1]
n = int(input())
op = ""
for i in range(n):
op += next_palindrome(input())+"\n"
print(op[:-1], end="")