51Nod 1010 只包含因子2 3 5的数

//Asimple
#include <bits/stdc++.h>
#define swap(a,b,t) t = a, a = b, b = t
#define CLS(a, v) memset(a, v, sizeof(a))
#define debug(a)  cout << #a << " = "  << a <<endl
#define test() cout<<"=========="<<endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int maxn = 20000+5;
ll n, m, res, ans, len, T, k, num, sum, t;
ll a[maxn];

void init(){
    ll er, san, wu;
    er = san = wu = 0;
    a[0] = 1;
    len = 0;
    while( a[len]<=1e18 ) {
        a[++len] = min(2*a[er], min(3*a[san], 5*a[wu]));
        if( a[len]==2*a[er] ) er ++;
        if( a[len]==3*a[san] ) san ++;
        if( a[len]==5*a[wu] ) wu ++;
    }
}

ll b_search(ll low, ll high, ll num){
    while( low<high ) {
        ll mid = (low+high)/2;
        if( a[mid]==num ) return num;
        else if(a[mid]<num ) low = mid+1;
        else high = mid;
    }
    return a[low];
}

void input() {
    ios_base::sync_with_stdio(false);
    init();
    cin >> T;
    while( T -- ) {
        cin >> n;
        ans = b_search(1, len, n);
        cout << ans << endl;
    }
}

int main(){
    input();
    return 0;
}