Given Input is a list of integers with atleast 2 numbers in the input array. Write a function that returns maximum prduct value of not empty subset of those given numbers.
Note: The product always consists of 2 or more given numbers from the list. All input values are integers
eg.
[0,3,-2,5] => "15"
[0,0] => "0"
[0,-1,1] => "0"
[0,-1,-1] => "1"
[0,0,1] => "0"
[0,0,-1] => "0"