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).
a = int(input())
count = 1
for i in range(1, 10**18+1):
    if count == a:
        print(i)
        break
    for j in range(2, i):
        if i % j == 0:
            count += 1
            if count == a:
                print(i)
                break
    count = 1
        
    