#include <iostream>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
using namespace std;
#define ll long long

int main() {
  ll X;
  cin >> X;
  std::vector<ll> v;
  std::map<ll, ll> m;
  for(ll i = 2; i <= sqrt(X)+1; i++) {
    while(X % i == 0) {
      X /= i;
      if(m.find(i) == m.end()) {
        m[i] = 1;
        v.push_back(i);
      }
      else {
        m[i]++;
      }
    }
  }
  if(m.find(X) == m.end()) {
    m[X] = 1;
    v.push_back(X);
  }
  else {
    m[X]++;
  }
  ll ans = 1;
  for(int i = 0; i < v.size(); i++) {
    if(m[v.at(i)] % 2 == 1)
    ans *= v.at(i);
  }
  cout << ans << endl;


}