Find the smallest possible integer x, that has exactly n divisors.
One positive integer n (1≤n≤16).
Print the smallest possible integer x that has exactly n divisors.