Given the number *n*, find the smallest positive integer which has exactly *n* divisors. It is guaranteed that for the given *n* the answer will not exceed 10<sup class="upper-index">18</sup>.
The first line of the input contains integer *n* (1 ≤ *n* ≤ 1000).
n=int(input())
primes=[2,3,5,7,11,13,17,19,23,29]
def f(n,i):
  # print(n,i)
  if n==1:
    return 1
  if i==10:
    return 10**9
  ans=10**9
  for j in range(2,n+1):
    if n%j==0:
      ans=min(ans,primes[i]**(j-1)*f(n//j,i+1))
  return ans
print(f(n,0))