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

#define ll long long
#define ull unsigned long long
#define nl '\n'
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define rall(s)  s.rbegin(), s.rend()
#define getline(s) getline(cin>>ws,s)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define pi  3.141592653589793

/*
███╗░░██╗███████╗░██████╗░███╗░░░███╗
████╗░██║██╔════╝██╔════╝░████╗░████║
██╔██╗██║█████╗░░██║░░██╗░██╔████╔██║
██║╚████║██╔══╝░░██║░░╚██╗██║╚██╔╝██║
██║░╚███║███████╗╚██████╔╝██║░╚═╝░██║
╚═╝░░╚══╝╚══════╝░╚═════╝░╚═╝░░░░░╚═╝

*/

void Fast_IO(){
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
// freopen("filename.in", "r", stdin);
// freopen("filename.txt", "w", stdout);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}


set<ll>prime_factors(ll n){
    set<ll>ans;
    while (n%2==0){
        ans.emplace(2);
        n/=2;
    }
    for(int i=3; i< sqrt(n); i++){
        while(n%i==0){
            ans.emplace(i);
            n/=i;
        }
    }
    if(n) ans.emplace(n);
    return ans;
}



void solve(){
  ll n; cin>>n;
  set<ll>st = prime_factors(n);
    ll res =1;
  for(auto&i:st) res*=i;
  cout<<res<<nl;



}

int main(){
    Fast_IO();
int t =1;
//cin>>t;
while(t--){
solve();
}
return 0;
}