// @Rakibul-Islam :) 
 
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
const ll INF = 1e18;
const int inf = 2e9;
const int mod = 1e9+7;
const int N = 1e5+10;
const int p = 998244353;
 
vector<bool> prime(N, 1);
vector<int> spf(N);
 
void testcase(){
    int n;
    cin>>n;
    map<int, int> cnt;
 
    while(n>1){
        int t = spf[n];
        n /= t;
        cnt[t]++;
    }
 
    if(n>1)cnt[n]++;
    ll ans = 1;
    for(auto [x, y]:cnt){
        if(y%2==1){
            ans *= x;
        }
    }
    cout<<ans<<"\n";
}   
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int testCase = 1;
    cin>>testCase;
 
    prime[0] = prime[1] = 0;
    for(int i=2; i<N; i++){
        if(prime[i]){
            spf[i] = i;
            for(int j=i+i; j<N; j+=i){
                prime[j] = 0;
                spf[j] = i;
            }
        }
    }
 
    cout<<fixed<<setprecision(20);
    for(int i=1;i<=testCase; i++){
        //cout<<"Case "<<i<<": ";
        testcase();
    }
    return 0;
}