#include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> //#include<cctype> #include<climits> #include<iostream> #include<string> #include<vector> #include<map> //#include<list> #include<queue> #include<deque> #include<algorithm> //#include<numeric> #include<utility> #include<complex> //#include<memory> #include<functional> #include<cassert> #include<set> #include<stack> const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll; typedef pair<int, int> pii; bool p[1000100]; int main() { cin.tie(0); ios::sync_with_stdio(false); ll X; cin >> X; for (int i = 2; i < 1000100; i++) { if (!p[i]) { for (int j = 2; j*i < 1000100; j++) p[i*j] = true; } } ll ans = 1; for (ll i = 2; i*i <= X; i++) { if (p[i]) continue; if (X%i) continue; int cnt = 0; while (X%i == 0) { cnt++; X /= i; } if (cnt%2) ans *= i; } ans *= X; cout << ans << endl; return 0; }