import collections
import math
import random
import sys
from functools import *
from heapq import *

input = lambda: sys.stdin.readline().rstrip("\r\n")
ints = lambda: list(map(int, input().split()))

# MOD = 998244353
# MOD = 10 ** 9 + 7

def solve() -> None:
    n = int(input())
    arr = ints()
    
    arr.sort(reverse=True)
    res = collections.deque([])
    for i in range(n):
        if i % 2 == 1:
            res.append(arr[i])
        else:
            res.appendleft(arr[i])
    ans = res[0]*res[-1]
    for i in range(n-1):
        ans += res[i]*res[i+1]
    print(ans)

t = int(input())
for _ in range(t):
    solve()