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())
n_1 = 0
number = n
dividers = set()
while len(dividers) != n:
    number += 1
    dividers = set(list(filter(lambda x: number % x == 0, [i for i in range(1, number + 1)])))
print(number)