import java.math.BigInteger;
import java.util.Scanner;
 
public class Main {
    public static void main(String args[]) {
		int[] input,output;
		input = new int[10000];
		output = new int[10000];
		int iL,oL;
		BigInteger mul,rem;
		
		Scanner cin = new Scanner(System.in);
		int n = cin.nextInt();
		int cases = n;
		while (n > 0) {
			if(n == cases)
				;
			else
				System.out.println("");
			n--;
			String tmp = cin.next();
			iL = 0; oL = 0;
			if(tmp.length()%2==1) {
				input[0] = tmp.charAt(0)-48;
				iL++;
				for(int j=1;j<tmp.length();iL++,j++) {
					input[iL] = tmp.charAt(j)-48;
					input[iL] = input[iL]*10 + (tmp.charAt(j+1)-48);
					j++; 
				}
			}
			else {
				for(int j=0;j<tmp.length();iL++,j++) {
					input[iL] = tmp.charAt(j)-48;
					input[iL] = input[iL]*10 + (tmp.charAt(j+1)-48);
					j++; 
				}
			}
			/*for(int j=0;j<iL;j++) {
				System.out.print(input[j]); //check input
				System.out.print(" ");
			}*/
			mul = BigInteger.valueOf(0); rem = BigInteger.valueOf(0);
			for(int j=0;j<iL;j++) {
				rem = rem.multiply(BigInteger.valueOf(100));
				rem = rem.add(BigInteger.valueOf(input[j]));
				for(int k=9;k>=0;k--) {
					BigInteger cmp = mul;
					cmp = cmp.multiply(BigInteger.valueOf(10));
					cmp = cmp.add(BigInteger.valueOf(k));
					cmp = cmp.multiply(BigInteger.valueOf(k));
					if(cmp.compareTo(rem) < 1) {
						rem = rem.subtract(cmp);
						//cout << "debug : " << mul*10+k << " " << rem << " ";
						mul = mul.multiply(BigInteger.valueOf(10));
						mul = mul.add(BigInteger.valueOf(k*2));
						//cout << mul << endl;
						output[oL] = k;
						oL++;
						break;
					}
				}
			}
			for(int j=0;j<oL;j++) System.out.print(output[j]); //check output
		} //one case ends here
	}
}