int main() {
	int m;
	int mn[N];
	int st[N];
	int ans = 1;
	cin >> m;
	int r = m;
	int k = 0;
	for (int i = 2; i < m; i++) {

		if (r % i == 0) {
			st[k] = 0;
			mn[k] = i;
			while (r%i == 0) {
				st[k] += 1;
				r /= i;
			}
			if (st[k] % 2 != 0) {
				st[k]--;
			}

			k++;
		}
	}
	for (int i = 0; i <= k; i++) {
		if (st[i] > 1) {
			ans *= pow(mn[i], st[i]);
		}
	}
	cout << ans;
	system("pause");
}