#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
const int N = 1e9 + 1;
int k;
vector<int> v;
for(int i = 1;i<N;i*=2){
v.push_back(i);
}
k = v.size();
for(int i = 0;i<k;i++){
for(int j = v[i];j<=N/3;){
j*=3;
v.push_back(j);
}
}
k = v.size();
for(int i = 0;i<k;i++){
for(int j = v[i];j<=N/5;){
j*=5;
v.push_back(j);
}
}
k = v.size();
for(int i = 0;i<k;i++){
for(int j = v[i];j<=N/7;){
j*=7;
v.push_back(j);
}
}
k = v.size();
sort(v.begin(),v.end());
int n;
cin>>n;
int t;
for(int i = 0;i<n;i++){
scanf("%d",&t);
printf("%d\n",*lower_bound(v.begin(),v.end(),t));
}
}