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

typedef long long ll;

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

int main() {
	ll X, Y=1;
	cin >> X;

	map<ll,ll> m;
	m = prime_factor(X);

	for (auto itr = m.begin(); itr != m.end(); itr++) {
		//cout << itr->first <<" "<< itr->second << endl;
		if (itr->second % 2 != 0) {
			Y *= itr->first;
		}
	}
	cout << Y << endl;
}