2285: Decompose

2285: Decompose

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	267	149	Standard

Give you an positive integer N(1<=N<=30), you can decompose n to several positive integers: A1, A2, ... Ak. (1<=k<=N) And A1 + A2 + ... + Ak = N. Now i want to know what's the maximal product of these k integers.

Input

The input contains several test cases. For each test case it contains a positive integer N. The end of input is indicated by end-of-file.

Ouput

For each test case, output K, here K is the maximal product of decomposed numbers.

Sample Input

3
5
6

Sample Output

3
6
9

 

Problem Source: sharang

#include<stdio.h>
int cal(int n)
{
    if(n<=4) return n;
    return 3*cal(n-3);
}
int main()
{
    int n;
    while(scanf("%d",&n)==1)
    {
        printf("%d/n",cal(n));
    }
    return 0;
}