//#include #include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include #include using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; #define ext exit(0) #define rep(i,n) for(int i = 0; i < (n); i++) #define pb push_back #define eb emplace_back #define all(x) x.begin() , x.end() #define fi first #define se second #define Yes() {puts("YES");ext;} #define No() {puts("No"); ext;} #define P pair #define vb vector #define vi vector #define vll vector #define vvi vector<> #define vs vector #define vP vector

#define ssz s.size() #define tsz t.size() const ll mod = 1000000007; //const ll mod = 998244353; const ld PI = 3.14159265358979; const int INF = 1001001001; const ll LINF = (1LL << 60); const int MX = 200005;//DP...? ll gcd (ll a , ll b) {if (a < b) swap(a , b);if (b == 0) return 1;if (a % b == 0) return b;else return gcd (b , a % b);} bool is_2power (ll x) { if((x & (x - 1)) == 0) return true; else return false;} ll keta (ll x) {ll ret = 0; while (x) {x /= 10;ret++;} return ret;} int in () {int x;scanf("%d\n" , &x);return x;} bool is_prime (ll x) { if (x == 1) return false; if (x == 2 || x == 3 || x == 5 || x == 7) return true; if((x & 1) == 0) return false; for (ll i = 3; i * i <= x; i += 2) if(x % i == 0)return false; return true; } void is_prime2() { const int sz = 10001; //使う時は外に出す vb table(sz , 0); //使う時は外に出す for (int i = 2; i < sz; i++) { for(int j = 2; i * j <= sz; j++) { table[i * j] = true; } } } vector divisor (ll x) { vector ret; for (int i = 2; i * i <= x; i++) { while (x % i == 0) { ret.push_back(i); x /= i; } } if (x > 1) { ret.push_back(x); } return ret; } ll modpow (ll x , ll p , ll m) { ll ret = 1; while (p > 0) { if(p & 1)ret *= x; x *= x; x %= m; p >>= 1; } return ret; } /** memo **/ //vs ans; //int n; //vi dp(n + 10 , 0); //v.erase(unique(v.begin(), v.end()), v.end()); void solve() { return; } int main() { cin.tie(0); ios::sync_with_stdio(false); ll x; cin >> x; map mp; for (ll i = 2; i * i <= x; i++) { while (x % i == 0) { mp[i]++; x /= i; } } if (x > 1) { mp[x]++; } ll y = 1; for (auto p : mp) { if (p.se % 2 == 1) { y *= p.fi; } } cout << y << endl; return 0; }