Maximum Strength of a Group

Given an array of numbers, partition it into two non-empty groups such that the product of their sums is maximized.

Examples
Input: [3,-1,-5,2,5,-9]
Output: 1350
Hints

Maximum Strength of a Group

Given an array of numbers, partition it into two non-empty groups such that the product of their sums is maximized.