#include <utility> // for std::swap
#include <set>
#include <algorithm>
#include <iterator>
#include <string>
#include <iostream>
using namespace std;
int x; string input;
 
int findPalindrome(int min) {
	x = min + 1;
	while (x>min) {
 
		std::string input = std::to_string(x);
		if (input == string(input.rbegin(), input.rend())) {
		    break;
		}
		++x;
	}
	return x;
}
 
int main() {
 
	int num, focus[50], lx = 1; string ret = "";
	cin >> num;
	while (lx <= num) {
		cin>>focus[lx];
		lx=lx+1;
	}
	lx=1;
	while (lx <= num) {
		ret += std::to_string(findPalindrome(focus[lx]));
		ret += "\n";
		lx=lx+1;
	}
	cout << ret;
 
	return 0;
}
 

I2luY2x1ZGUgPHV0aWxpdHk+IC8vIGZvciBzdGQ6OnN3YXAKI2luY2x1ZGUgPHNldD4KI2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPGl0ZXJhdG9yPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8aW9zdHJlYW0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCB4OyBzdHJpbmcgaW5wdXQ7CgppbnQgZmluZFBhbGluZHJvbWUoaW50IG1pbikgewoJeCA9IG1pbiArIDE7Cgl3aGlsZSAoeD5taW4pIHsKCgkJc3RkOjpzdHJpbmcgaW5wdXQgPSBzdGQ6OnRvX3N0cmluZyh4KTsKCQlpZiAoaW5wdXQgPT0gc3RyaW5nKGlucHV0LnJiZWdpbigpLCBpbnB1dC5yZW5kKCkpKSB7CgkJICAgIGJyZWFrOwoJCX0KCQkrK3g7Cgl9CglyZXR1cm4geDsKfQoKaW50IG1haW4oKSB7CgoJaW50IG51bSwgZm9jdXNbNTBdLCBseCA9IDE7IHN0cmluZyByZXQgPSAiIjsKCWNpbiA+PiBudW07Cgl3aGlsZSAobHggPD0gbnVtKSB7CgkJY2luPj5mb2N1c1tseF07CgkJbHg9bHgrMTsKCX0KCWx4PTE7Cgl3aGlsZSAobHggPD0gbnVtKSB7CgkJcmV0ICs9IHN0ZDo6dG9fc3RyaW5nKGZpbmRQYWxpbmRyb21lKGZvY3VzW2x4XSkpOwoJCXJldCArPSAiXG4iOwoJCWx4PWx4KzE7Cgl9Cgljb3V0IDw8IHJldDsKCglyZXR1cm4gMDsKfQo=

OQoyMQoyMTMzCjIwMDAKMjM0NTYKNTAwMDAKODAzNDE3Cjk4NzY1NDMyMQo5ODc2NTQzMjEwCjk4NzY1NDMyMTAxCgoK

9
21
2133
2000
23456
50000
803417
987654321
9876543210
98765432101