You are given an array of integers a_1,a_2,…,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).

Input

The input consists of multiple test cases. The first line contains an integer t (1≤ t≤ 2 ⋅ 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≤ n≤ 10^5) — the size of the array.

The second line of each test case contains n integers a_1,a_2,…,a_n (-3× 10^3≤ a_i≤ 3× 10^3) — given array.

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

Output

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

Example

Input


4
5
-1 -2 -3 -4 -5
6
-1 -2 -3 1 2 -1
6
-1 0 0 0 -1 -1
6
-9 -7 -5 -3 -2 1


Output


-120
12
0
945

Note

In the first test case, choosing a_1,a_2,a_3,a_4,a_5 is a best choice: (-1)⋅ (-2) ⋅ (-3)⋅ (-4)⋅ (-5)=-120.

In the second test case, choosing a_1,a_2,a_3,a_5,a_6 is a best choice: (-1)⋅ (-2) ⋅ (-3)⋅ 2⋅ (-1)=12.

In the third test case, choosing a_1,a_2,a_3,a_4,a_5 is a best choice: (-1)⋅ 0⋅ 0⋅ 0⋅ (-1)=0.

In the fourth test case, choosing a_1,a_2,a_3,a_4,a_6 is a best choice: (-9)⋅ (-7) ⋅ (-5)⋅ (-3)⋅ 1=945.
for _ in " "*int(input()):
  n=int(input())
  a=list(map(int,input().split()))
  cntp = 0
  cnto = 0
  cntn = 0
  cntpl = []
  cntol = []
  cntnl = []

  for i in range(n):
    if a[i] < 0:
      cntn+=1
      cntnl.append(abs(a[i]))
    elif a[i] > 0:
      cntp+=1
      cntpl.append(a[i])
    else:
      cnto+=1
      cntol.append(a[i])

  cntol.sort()
  cntnl.sort()
  cntpl.sort()
  cntol = cntol[::-1]
  cntnl = cntnl[::-1]
  cntpl = cntpl[::-1]

  s = 0

  if len(cntnl) >=4 and len(cntpl) >= 1:
    s = max(s,cntnl[0]*cntnl[1]*cntnl[2]*cntnl[3]*cntpl[0])
  if len(cntnl) >= 2 and len(cntpl) >= 3:
    s = max(s,cntnl[0]*cntnl[1]*cntpl[0]*cntpl[1]*cntpl[2])
  if len(cntpl) >= 5:
    s = max(s,cntpl[0]*cntpl[1]*cntpl[2]*cntpl[3]*cntpl[4])
  if(len(cntpl)==0):
    if len(cntol) > 0:
      s = 0
    else:
      s = -(cntnl[-1]*cntnl[-2]*cntnl[-3]*cntnl[-4]*cntnl[-5])
  if len(cntol) == n:
    s = 0
  if len(cntol) >= 1:
    s = max(s,0)
  if n == 5:
    s = a[0]*a[1]*a[2]*a[3]*a[4]
  print(s)