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

using ll=long long;
ll mod=1000000007;
ll INF=1LL<<60;

vector<pair<ll,ll>> prime_factorize(ll N){
	vector<pair<ll,ll>> res;
	for(ll a=2;a*a<=N;a++){
		if(N%a!=0)continue;
		ll ex=0;
		while(N%a==0){
			ex++;
			N/=a;
		}
		res.push_back({a,ex});
	}
	if(N!=1)res.push_back({N,1});
	return res;
}

int main() {
	ll X,Y=1;
	cin >> X;
	auto P=prime_factorize(X);
	for(int i=0;i<P.size();i++){
		if(P[i].second%2==1){
			Y*=P[i].first;
		}
	}
	cout << Y << endl;
}