Max Product :
Difficulty Level : Medium
Submissions : 305
Asked In :
Marks :10
: 4 | : 0
Given a number N, the task is to split the Number into multiple parts in such a fashion as to find the highest Product.
Mathematically, we are given n and we need to maximize ($$$ a_1 * a_2 * a_3 …. * a_K $$$) such that ($$$ n = a_1+ a_2 + a_3 … + a_K$$$) and ($$$a_1, a_2, … a_k > 0$$$).
Input
The online line contains an integer N ($$$1\le N \le 100$$$)
Output
For each test case print the maximum product that is possible.
Examples
Input
6
Output
9
Input
4
Output
4
