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

// ------------ Prime Factorization (Update 8/6) ------------ //
std::map<unsigned long long, unsigned> prime_factorize(unsigned long long x) {
	std::map<unsigned long long, unsigned> ret;
	for (unsigned i = 2; 1ULL * i * i <= x; i++) {
		while (x % i == 0) x /= i, ret[i]++;
	}
	if (x != 1) ret[x]++;
	return ret;
}

long long x;
int main() {
	cin >> x;
	map<unsigned long long, unsigned> res = prime_factorize(x);
	long long ret = 1;
	for(pair<unsigned long long, unsigned> i : res) {
		if(i.second & 1) ret *= i.first;
	}
	cout << ret << endl;
	return 0;
}