#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <math.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <math.h>
#include <time.h>

using namespace std;

#define FOR(I,N) for(int I = 0; I < (int)(N); I++)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)
#define ll long long

typedef pair<int, int> P;

string sValueOf(int v){stringstream ss;ss<<v;return ss.str();}
int parseInt(string v){int i;stringstream ss(v);ss>>i;return i;}
void fast_io() {cin.tie(0); ios::sync_with_stdio(false);}

int main(){
	int i,j;
	ll X,Y;
	cin>>X;
	vector<ll> insu;
	ll r = sqrt(X);
	///bool can = false;
	for(int i = 2;i<=r;i++){
		if(X%i==0){
			X/=i;
			if(insu.size()!=0&&insu[insu.size()-1]==i){
				insu.erase(insu.begin()+insu.size()-1);
			}else insu.pb(i);
			i--;
			///can = true;
		}
	}
	insu.pb(X);
	ll ans = 1;
	FOR(i,insu.size()){
		ans*=insu[i];
	}
	///if(!can)ans = X;
	cout<<ans<<endl;
	return 0;
}