Problems
Two factors
Two factors
Find the least number $n$ that can we represented as a product $n = a \cdot b$ in $k$ ($1 ≤ k ≤ 50$) ways. Products $a \cdot b$ and $b \cdot a$ are the same, all numbers are positive integers.
Input
One number $k$.
Output
Print one number $n$.
Input example #1
1
Output example #1
1
Input example #2
2
Output example #2
4