#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<iomanip>
#include<regex>
#include<random>
using namespace std;
#define int long long
#define uint unsigned long long
const int mod=1e9+7;
const int inf=9223372036854775807;
const double eps=1e-9;
int pri[11]={2,3,5,7,11,13,17,19,23,29,31};
signed main(){
	int t,x;
	cin>>t;
	while(cin>>x){
		int y=inf;
		for(int i=0;i<=10;i++){
			int p=pri[i],xx=x,e=0;
			while(xx%p==0){
				xx/=p;
				e++;
			}
			if(pow(p,e+1)*x>=inf)
				continue;
			int tmp=1;
			for(int i=0;i<=e;i++)
				tmp*=p;
			y=min(y,tmp*x);
		}
		cout<<y<<endl;
	}
}