#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[13] = { 2,3,5,7,11,13,17,19,23,29,31,37 };
int co[13] = {}, co1[35][13] = {};
int main() {
	for (int i = 2; i < 33; i++) {
		for (int j = 0; j < 12; j++) {
			int i1 = i;
			while (i1 % p[j] == 0) {
				i1 /= p[j];
				co1[i][j]++;
			}
		}
	}
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t;
	cin >> t;
	for (int i = 0; i < t; i++) {
		long long x, x1;
		cin >> x;
		for (long long j = 2; j < 33; j++) {
			for (int k = 0; k < 12; k++) {
				x1 = x;
				co[k] = 1;
				while (x1 % p[k] == 0) {
					x1 /= p[k];
					co[k]++;
				}
			}
			long long c = 1, c1 = 1;
			for (int k = 0; k < 12; k++) {
				c *= co[k];
				c1 *= co[k] + co1[j][k];
			}
			if (c * 2 == c1) {
				cout << x * j << endl;
				break;
			}
		}
	}
}