#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}


int main(void){
	ll X;
	cin>>X;
	ll n = X;
	map<ll,ll>p;
	for(ll i=2;i*i<=n;i++){
		if(X%i==0){
			ll tmp = 0;
			while(X%i==0){
				X/=i;
				tmp++;
			}
			p[i]=tmp;
		}
	}
	if(X>1)p[X]=1;
	ll ans = 1;
	for(auto itr = p.begin();itr!=p.end();++itr){
		ll P = itr->first;
		ll num = itr->second;
		if(num%2==1)ans*=P;
	}
	cout<<ans<<endl;
	return 0;
}