651. Maximizing Product of Integers
Ram and his friend were playing a game. Ram's friend challenged him to break a given integer n into the sum of k positive integers, where k is greater than or equal to 2, in order to maximize the product of those integers. Your task is to find the maximum product that can be obtained.
The first line of input contains a single integer N.
Print the maximum product as the output.
2 <= n <= 58