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$.