Given an array that contains both positive and negative integers, find the product of the maximum product subarray.

**Assumption: **There is always a positive product possible, i.e., no array of this form: {0,-20,0,0} or {-20}.

**Input:**

First line of input contain number of test cases T. First line of test case contain the size of array and second line of test case contain the array elements.

**Output:**

Maximum product of subarray is displayed to the user.

**Constraints:**

1 <=T<= 100

1 <=N<= 9

-10 <=arr[i]<= 10

**Example:**

**Input:**

3

5

6 -3 -10 0 2

6

2 3 4 5 -1 0

10

8 -2 -2 0 8 0 -6 -8 -6 -1

**Output:**

180

120

288

just_kiddin | 61 |

Devina Mohan | 59 |

BackSlashNull | 53 |

PALINDROME | 52 |

Sangeeta S | 52 |

gameghost07 | 488 |

xyz2017 | 486 |

N NAGA SAI KRISHNA | 445 |

Divyasri | 426 |

Anshu Ahirwar | 424 |

akhayrutdinov | 3391 |

sanjay05 | 3239 |

Jasleen Kaur 2 | 2012 |

Elite Coder | 1805 |

Michael Riegger | 1791 |