#include<stdio.h>

 #include<algorithm>

 using namespace std;

 typedef long long ll;

 ll prime[ ] = { ,,,,,,

                 ,,,,,

                 ,,,,,

                 };

 ll n ;

 int T;

 ll dfs( ll num , ll pos ,ll k , ll ans ){

     if( pos >  ) return ;

     ll res = ans ;

     for(int i=;i<=k;i++){

         if( n/prime[pos] < num ) break ;

         num *= prime[pos] ;

         res = max( res , dfs( num ,pos+ , i , ans*(i+) ) );

     }

     return res;

 }

 int main()

 {

     scanf("%d",&T);

     while(T--){

         scanf("%lld",&n);

         ll ans = dfs(1ll,,,);

         printf("%lld\n",ans);

     }

     return ;

 }