from collections import Counter
def PrimeFactorize(N):
    if N==1:
        return []
    p=[]
    i=2
    while i**2<=N:
        if N%i==0:
            p.append(i)
            N//=i
        else:
            i+=1
    if N!=1:
        p.append(N)
    return p

X = int(input())
if X == 1:
  print(1)
  exit()

primes = PrimeFactorize(X)
c = Counter(primes)
ans = 1
for k, v in c.items():
  if v%2 == 1:
    ans *= k

print(ans)