Given an integer n, break it into the sum of k positive integers, where k >= 2, and maximize the product of those integers.
n
k
k >= 2
Return the maximum product you can get.
2 <= n <= 58
n = 2
1
n = 10
36