#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

pair<vector<ll>, vector<ll>> primeFactors(ll n){
    vector<ll> p,e;
    ll m = n;
    for(ll i = 2; i*i <= n; i++){
        if(m%i != 0) continue;
        int c = 0;
        while(m%i == 0) c++, m /= i;
        p.push_back(i); e.push_back(c);
    }
    if(m > 1){
        p.push_back(m); e.push_back(1);
    }
    return make_pair(p,e);
}

ll X;

ll solve(){
    vector<ll> p,e;
    tie(p,e) = primeFactors(X);
    ll res = 1;
    int k = p.size();
    for(int i = 0; i < k; i++){
        if(e[i]%2 == 1){
            res *= p[i];
        }
    }
    return res;
}

int main(){
    while(cin >> X){
        cout << solve() << endl;
    }
}