#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>

#include <string.h>
#include <utility>

typedef long long ll;
#define INF (1e9+1)
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

bool erasu[1000001];

vector<int> prim;


ll prime_factorization(ll n){

	ll ans =1;

	/*for(int i=2; i*i<=n; i++)*/
	for(int i=0; i<prim.size(); i++){
		int  cp=0;

		while(n%prim[i] ==0){
			cp++;

			n /=prim[i];
		}

		if(cp%2 !=0){
			ans *= prim[i];
		}
	}

	if( n !=1) ans *=n;

	return ans;

}


void shieve(int n){

	rep(i,n+1){
		erasu[i] =true;
	}

	for(int i=2; i<=n; i++){
		if(erasu[i]){
			prim.push_back(i);
			for(int j= 2*i; j<=n; j +=i){
				erasu[j] = false;
			}
		}
	}
}
int main(){


	ll x=0;
	cin>>x;

	shieve(sqrt(x));
/*	for(int i=0; i<prim.size(); i++){
		cout<<prim[i]<<endl;
	}*/

	cout<<prime_factorization(x)<<endl;
}