#include <iostream>
#include <map>
#include <cmath>

using namespace std;

int main() {
	long long x;
	cin >> x;
	map<long long, long long> factors;
	for (long long divisor = 2; divisor * divisor <= x; ++divisor) {
		while (x % divisor == 0) {
			x /= divisor;
			++factors[divisor];
		}
	}
	if (x > 1) {
		++factors[x];
	}
	long long y = 1;
	for (map<long long, long long>::const_iterator it = factors.begin();
		it != factors.end();
		++it) {
		if (it->second % 2 != 0) {
			y *= it->first;
		}
	}
	cout << y << endl;
	return 0;
}