import math 
  
def productPrimeFactors(n): 
    product = 1
      
    # Handle prime factor 2 explicitly so that 
    # can optimally handle other prime factors. 
    if (n % 2 == 0): 
        product *= 2
        while (n%2 == 0): 
            n = n/2
              
    # n must be odd at this point. So we can 
    # skip one element (Note i = i +2) 
    for i in range (3, int(math.sqrt(n)), 2): 
        # While i divides n, print i and 
        # divide n 
        if (n % i == 0): 
            product = product * i 
            while (n%i == 0): 
                n = n/i 
                  
    # This condition is to handle the case when n 
    # is a prime number greater than 2 
    if (n > 2): 
        product = product * n 
          
    return product      
      
# main() 
n = 510143758735509025530880200653196460532653147
print (int(productPrimeFactors(n))) 
  
