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).
#27e
n = int(input())
c = 0
i = 1
t = True
while t:
    c = 0
    for a in range(1, i + 1):
        if i % a == 0:
            c += 1
    if c == n:
        print(i)
        t = False
    else:
        i += 1