You are given nn integers a1,a2,…,ana1,a2,…,an. Find the maximum value of max(al,al+1,…,ar)⋅min(al,al+1,…,ar)max(al,al+1,…,ar)⋅min(al,al+1,…,ar) over all pairs (l,r)(l,r) of integers for which 1≤l<r≤n1≤l<r≤n.
The first line contains a single integer tt (1≤t≤100001≤t≤10000) — the number of test cases.
The first line of each test case contains a single integer nn (2≤n≤1052≤n≤105).
The second line of each test case contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1061≤ai≤106).
It is guaranteed that the sum of nn over all test cases doesn't exceed 3⋅1053⋅105.
For each test case, print a single integer — the maximum possible value of the product from the statement.
4
3
2 4 3
4
3 2 3 1
2
69 69
6
719313 273225 402638 473783 804745 323328
12
6
4761
381274500335