#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define MULT_TEST 1
using namespace std;
typedef long double ldb;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
inline void Solve() {
    int n, tot = 0, res = 0;
    n = read();
    vector<int> a(n + 1), ans(n + 1);
    for (int i = 1; i <= n; i++) a[i] = read();
    sort(a.begin() + 1, a.end());
    vector<int> A, B;
    A.push_back(a[1]), B.push_back(a[2]);
    for (int i = 3; i <= n; i++) {
        if (A.back() * a[i] > B.back() * a[i]) B.push_back(a[i]);
        else A.push_back(a[i]);
    }
    reverse(A.begin(), A.end());
    for (auto t : A) ans[++tot] = t;
    for (auto t : B) ans[++tot] = t;
    // if ((ans[n - 1] - ans[n]) * (ans[n - 2] - ans[1]) < 0) 
    //     swap(ans[n - 1], ans[n]);
    for (int i = 1; i <= n; i++) res += ans[i] * ans[i % n + 1];
    printf("%lld\n", res);
}
signed main() {
    int _ = 1;
#if MULT_TEST
    _ = read();
#endif 
    while (_--) Solve();
    return 0;
}