import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class NumberSystems {
public static void main
(String[] args
) { Scanner scanner
= new Scanner
(System.
in); int t= scanner.nextInt();
for(int j=0; j<t; j++) {
int n = scanner.nextInt();
int pom=n;
char[] charArray = string.toCharArray();
List<Integer> integerList = new ArrayList<>();
List<Integer> integerList1 = new ArrayList<>();
while (pom != 0) {
integerList.add(pom % 16);
pom = pom / 16;
}
while (n != 0) {
integerList1.add(n % 11);
n = n / 11;
}
for (int i = 0; i < integerList1.size(); i++) {
if (integerList1.get(i) == 10) {
strings1
[i
] = String.
valueOf(string.
charAt(0)); } else {
strings1
[i
] = String.
valueOf(integerList1.
get(i
)); }
}
for (int i = 0; i < strings1.length / 2; i++) {
strings1[i] = strings1[strings1.length - (i + 1)];
strings1[strings1.length - (i + 1)] = pom1;
}
for (int i = 0; i < integerList.size(); i++) {
boolean division = integerList.get(i) >= 10;
if (division) {
int mod = integerList.get(i) % 10;
strings
[i
] = String.
valueOf(charArray
[mod
]); } else {
strings
[i
] = String.
valueOf(integerList.
get(i
)); }
}
for (int i = 0; i < strings.length / 2; i++) {
strings[i] = strings[strings.length - (i + 1)];
strings[strings.length - (i + 1)] = pom1;
}
}
}
}
}
}