A13711 | Maximum Product

You are given an array of integers $a_1,a_2,\ldots,a_n$ . Find the maximum possible value of $a_ia_ja_ka_la_t$ among all five indices $(i, j, k, l, t)$ ( $i<j<k<l<t$ ).

The input consists of multiple test cases. The first line contains an integer $t$ ( $1\le t\le 2 \cdot 10^4$ ) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a single integer $n$ ( $5\le n\le 10^5$ ) — the size of the array.

The second line of each test case contains $n$ integers $a_1,a_2,\ldots,a_n$ ( $-3\times 10^3\le a_i\le 3\times 10^3$ ) — given array.

It's guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$ .

For each test case, print one integer — the answer to the problem.