1 //2016.9.17
 2 #include <iostream>
 3 #include <cstdio>
 4 #include <algorithm>
 5 #define N 10000
 6 #define ll long long 
 7 
 8 using namespace std;
 9 
10 int arr[N];
11 
12 ll pow(ll a, ll b)//快速幂
13 {
14     ll ans = 1;
15     while(b)
16     {
17         if(b & 1)ans *= a;
18         a *= a;
19         b>>=1;
20     }
21     return ans;
22 }
23 
24 int main()
25 {
26     ll tmp; int cnt = 0;
27     for(int a = 0; a < 31; a++)
28     {
29         for(int b = 0; b < 20; b++)
30         {
31             for(int c = 0; c < 14; c++)
32             {
33                 for(int d = 0; d < 12; d++)
34                 {
35                     tmp = pow(2, a)*pow(3, b);
36                     if(tmp > 1e9)break;
37                     tmp *= pow(5, c);
38                     if(tmp > 1e9)break;
39                     tmp *= pow(7, d);
40                     if(tmp > 1e9)break;
41                     arr[cnt++] = tmp;
42                 }
43             }
44         }
45     }
46     sort(arr, arr+cnt);
47     int T, n;
48     scanf("%d", &T);
49     while(T--)
50     {
51         scanf("%d", &n);
52         int pos = lower_bound(arr, arr+cnt, n)-arr;
53         printf("%d\n", arr[pos]);
54     }
55 
56     return 0;
57 }