import math

n = int(input())


def  primefactor(a):
    pflist = []

    a_sqrt = math.floor(math.sqrt(a))


    while a % 2 == 0:
        a //= 2 
        pflist.append(2)

    for i in range(3,a_sqrt+1,2):
        while a % i == 0:
            a //= i 
            pflist.append(i)
    
    if a != 1:
        pflist.append(a)

    pflist2 = sorted(list(set(pflist)))
    pflist3 = [ ( i ,  pflist.count(i) ) for i in pflist2 ]
    return pflist3

pflist4 = primefactor(n)


ans = 1

if n != 1:
    for i in range(len(pflist4)):
        if pflist4[i][1] % 2 == 1:
            ans *= pflist4[i][0]

print(ans)