#include <bits/stdc++.h>
using namespace std;

long long sol(int n, vector<int> v){
    int minn, q_min, maxx, q_max;
    if(v[0] != v[1]){
        minn = min(v[0], v[1]);
        maxx = max(v[0], v[1]);
        q_min = 1;
        q_max = 1;
    }
    else{
        minn = v[0];
        maxx = v[0];
        q_min = 2;
        q_max = 2;
    }
    for(int i = 2; i < n; ++i){
        if(v[i] > maxx){
            maxx = v[i];
            q_max = 1;
        }
        else if(v[i] == maxx){
            q_max++;
        }
        else if(v[i] == minn){
            q_min++;
        }
        else if(v[i] < minn){
            minn = v[i];
            q_min = 1;
        }
    }
    bool all_eq = true;
    for(int i = 1; i < n; ++i) if(v[i] != v[0]) all_eq = false;
    if(all_eq) return (long long)  n * (n - 1);
    return (long long) 2 * q_min * q_max;
}

int main() {
    int t; cin >> t;
    for(int i = 0; i < t; ++i){
        int n; cin >> n;
        vector<int> v(n);
        for(int j = 0; j < n; ++j) cin >> v[j];
        cout << sol(n, v) << '\n';
    }
    return 0;
}