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).
from sys import stdin

def main():
	n = int(stdin.readline())
	
	for i in range(1,2*n+1):
		count = 0
		for j in range(1,2*n+1):
			if i%j==0:
				count+=1
			if count>n:
				break
		if count==n:
			print(i)
			break
main()
   				 	   	         	   		 		