import java.util.Scanner;

class PALIN
{
	public static int reverse(int n)
	{
		int reversed = 0;
		while (n > 0)
		{
			reversed = 10*reversed + n % 10;
			n = n/10;
		}
		return reversed;
	}
	
	public static boolean isPalindrome(int n)
	{
		return (n==reverse(n));
	}
	
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		
		for (int i=0;i<t; i++)
		{
			int n = sc.nextInt();
			for (int nxt=n+1;nxt<=1000000;nxt++)
			{
				if (isPalindrome(nxt)){
					System.out.println(nxt);
					break;
				}
			}
		}
	}
}