/*
 *   Copyright (c) 2025 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
bool ok(vector<int>&a,int n,int bit)
{
    int mx =0;
    int f=n,l=-1;
    for(int i=0;i<n;i++)
    {
        if(bit & (1<<i))
        {
            mx =max(mx,a[i]);
            f = min(f,i);
            l = max(l,i);
        }
    }
    if(a[f]==mx || a[l]==mx) return 0;
    int cnt =0;
    for(int i=0;i<n;i++)
    {
        if((bit & (1<<i)) && a[i]==mx) ++cnt;   
    }
    return cnt==1;
}

int main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int t; cin >> t; while(t--)
    {
        int n; cin >> n;
        vector<int> a(n);
        for(int i=0;i<n;i++) cin >> a[i];
        
        int lim = (1<<n);
        ll ans = 0;
        for(int bit=3;bit<lim;bit++)
        {
            if(__popcount(bit) < 3) continue;
            if(ok(a,n,bit)) ++ans;
        }
        cout<<ans<<'\n';
    }
}