N = input()

def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(i)
    i += 1
  if n > 1:
    table.append(n)
  return table


answer = 1
decom = prime_decomposition(N)
for i in set(decom):
    if decom.count(i) % 2 == 1:
        answer *= i

print answer