def nxtpalindrome(n):
j=i=n
a=1
while (1):
while (a!=0):
b=i%10
a=a+b*10
i=i/10
if(a==j):
return j
j+=1
i=j
a=[]
n=int(raw_input())
i=0
while(i<n):
a.append(int(raw_input()))
b=nxtpalindrome(a[i])
print b
i+=1
ZGVmIG54dHBhbGluZHJvbWUobik6CiAgICBqPWk9bgogICAgYT0xCiAgICB3aGlsZSAoMSk6CiAgICAgICAgd2hpbGUgKGEhPTApOgogICAgICAgICAgICBiPWklMTAKICAgICAgICAgICAgYT1hK2IqMTAKICAgICAgICAgICAgaT1pLzEwCiAgICAgICAgaWYoYT09aik6CiAgICAgICAgICAgIHJldHVybiBqCiAgICAgICAgais9MQogICAgICAgIGk9agoKYT1bXQpuPWludChyYXdfaW5wdXQoKSkKaT0wCndoaWxlKGk8bik6CiAgICBhLmFwcGVuZChpbnQocmF3X2lucHV0KCkpKQogICAgYj1ueHRwYWxpbmRyb21lKGFbaV0pCiAgICBwcmludCBiCiAgICBpKz0xICA=