#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

map<lint,lint> prime_factor(lint n){
	map<lint,lint> res;
	for(lint i=2;i*i<=n;i++){
		while(n%i==0){
			++res[i];
			n/=i;
		}
	}
	if(n!=1) res[n]=1;
	return res;
}

int main(){
	lint x,y=1;
	cin>>x;
	map<lint,lint> m;
	m=prime_factor(x);
	for(map<lint,lint>::iterator it=m.begin();it!=m.end();it++){
		//o(it->fi<<" "<<it->se);
		if(it->se%2) y*=it->fi;
	}
	o(y);
}