#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

const int N = 1e6+10,mo = 1e9+7;

int a[N];

int mp[N];


inline void solve(){
    int n;cin>>n;
    if(mp[n]){cout<<mp[n]<<"\n";return ;}
    ll ans=-1;
    for(int x=1;x*x<=n;x++){
        if(n%x==0){
            if((n-x)%2==0){
                int z,y;
                z=y=(n-x)/2;
                if(x!=n&&y!=n&&z>0&&n%z==0)ans=max(ans,x*y*z);
            }
            if((n-n/x)%2==0){
                int z,y;
                z=y=(n-n/x)/2;
                if(x!=n&&y!=n&&z>0&&n%z==0)ans=max(ans,(n/x)*y*z);
            }
        }
    }
    mp[n]=ans;
    cout<<ans<<"\n";
}



signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int WTN666=1;cin>>WTN666;
    while(WTN666--){
        solve();
    }
}