write a go solution for Description:
You are given n integers a_1,a_2,ldots,a_n. Find the maximum value of max(a_l,a_l+1,ldots,a_r)*min(a_l,a_l+1,ldots,a_r) over all pairs (l,r) of integers for which 1<=l<r<=n.

Input Format:
The first line contains a single integer t (1<=t<=10,000)  — the number of test cases.

The first line of each test case contains a single integer n (2<=n<=10^5).

The second line of each test case contains n integers a_1,a_2,ldots,a_n (1<=a_i<=10^6).

It is guaranteed that the sum of n over all test cases doesn't exceed 3*10^5.

Output Format:
For each test case, print a single integer  — the maximum possible value of the product from the statement.

Note:
Let f(l,r)=max(a_l,a_l+1,ldots,a_r)*min(a_l,a_l+1,ldots,a_r).

In the first test case,

- f(1,2)=max(a_1,a_2)*min(a_1,a_2)=max(2,4)*min(2,4)=4*2=8.
- f(1,3)=max(a_1,a_2,a_3)*min(a_1,a_2,a_3)=max(2,4,3)*min(2,4,3)=4*2=8.
- f(2,3)=max(a_2,a_3)*min(a_2,a_3)=max(4,3)*min(4,3)=4*3=12.

So the maximum is f(2,3)=12.

In the second test case, the maximum is f(1,2)=f(1,3)=f(2,3)=6.. Output only the code with no comments, explanation, or additional text.