use bigint; 


 $testCases = <STDIN>;
 chomp($testCases);
 @arr;

 for($i = 0; $i<$testCases; $i++) { #store values in array
 	$k = <STDIN>;
 	chomp($k);
 	@arr[$i] = $k;
 }
#cycle through array and test whether number stored is a palindrome
#palindrome printed must be greater than stored value
#if stored number is not palindrome increment until smallest palidrome greater thean k is found 
for($j = 0; $j<testCases; $j++) { 
	$win = 0;
	$temp = $arr[j];
	$temp++;  
	while($win == 0) {
		if(isPalindrome($temp)) { 
			printf ("%u \n", $temp);
			$win = 1;  
		}else {
			$temp++;
		}
	}
}

sub isPalindrome($orig){
	$reversed = 0, $n = $orig;
	while($n > 0) {
		$reversed = $reversed * 10 + n % 10;
		$n /= 10; 
	}
	if($orig == $reversed){
		return 1;
	}else {
		return 0;
	}
}