#include <bits/stdc++.h>

using namespace std;
using LL = long long;

const int N = 1e6+5;
constexpr LL INF = 0x3f3f3f3f3f3f3f3f;

vector<int> f[N];

void sieve(int n)
{
	for(int i = 1; i <= n; i++) {
		for(int j = i; j <= n; j += i) 
			f[j].push_back(i);
		sort(f[i].begin(), f[i].end());
	}
}

LL g[N];

LL solve(int n)
{
	if(g[n] != INF) return g[n];
	const vector<int> &factors = f[n]; 
	LL ans = -1;
	for(int i = 0; i < (int)factors.size(); i++) {
		for(int j = i; j < (int)factors.size(); j++) {
			LL k = n-factors[i]-factors[j];
			if(k < factors[j]) break;
			if(n%k == 0) ans = max(ans, (LL)factors[i]*(LL)factors[j]*k);
		}	
	}
	return g[n] = ans;
}

int main()
{
	// freopen("1.in", "r", stdin);
	clock_t st_time = clock();

	memset(g, 0x3f, sizeof g);
	sieve(1e6);
	int T; scanf("%d", &T);
	while(T--) {
		int n; scanf("%d", &n);
		printf("%lld\n", solve(n));
	}

	cerr << "time : " << (clock()-st_time)/CLOCKS_PER_SEC << "s" << endl;
	return 0;
}