#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long p[12] = { 2,3,5,7,11,13,17,19,23,29,31,33 };
int main() {
	int t;
	cin >> t;
	for (int i = 0; i < t; i++) {
		long long x, x1, co = 1;
		cin >> x;
		long long ans = 100000000000000000;
		for (int j = 0; j < 12; j++) {
			x1 = x;
			long long co = p[j];
			while (x1 % p[j] == 0) {
				x1 /= p[j];
				co *= p[j];
			}
			ans = min(co, ans);
		}
		cout << x * ans << endl;
	}
}