Problems

# Two factors

Find the least number n that can we represented as a product n = ab in k (1k50) ways. Products ab and ba are the same, all numbers are positive integers.

One number k.

#### Output

Print one number n.

Time limit 1 second
Memory limit 128 MiB
Input example #1
1

Output example #1
1

Input example #2
2

Output example #2
4