#include <iostream>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long LL;
const int N=1e9;
int num;
map<LL,int>mp;
LL a[5200];
void init()
{
LL i,j,k,l;
num=0;
for(i=0; i<31; i++)
for(j=0; j<20; j++)
for(k=0; k<13; k++)
for(l=0; l<12; l++)
{
LL res=pow(2,i)*pow(3,j)*pow(5,k)*pow(7,l);
if(res<=N&&!mp[res])
{
mp[res]=1;
a[num++]=res;
}
}
sort(a,a+num);
}
int bsearch(int left,int right,int k)
{//自己写的二分查找,也可以用stl,前提有序
while(left<right)
{
int mid=(right+left)/2;
if(a[mid]>=k)
right=mid;
else
left=mid+1;
}
return left;
}
int main()
{
int T;
init();
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
int ans=bsearch(1,num-1,n);
//int ans=lower_bound(a,a+num,n)-a;//upper_bound()
printf("%lld\n",a[ans]);
}
return 0;
}