#include <bits/stdc++.h>
using namespace std;
//#define int unsigned long long 
#define int long long
#define yyy cout<<"YES\n"
#define nnn cout<<"NO\n"
#define endl '\n'
typedef pair<int, int> PII;
#define MAP map<int,int>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define fi first
#define se second
#define rrr return
int dx[4] = {0, 0, 1,-1};
int dy[4] = {1, -1, 0, 0};
//void print(__int128_t x){if (x < 0){putchar('-');x = -x;}
//if (x > 9) print(x / 10);putchar(x % 10 + '0');}
int qmod(int a,int b,int mod){int ans=1; a=a%mod;
while(b){if(b&1==1) ans=ans*a%mod;a=a*a%mod;b>>=1;}return ans;}
int qpow(int a,int b){int ans=1;while(b)
{if(b&1==1) ans=ans*a;a=a*a;b>>=1;}return ans;}
int getor(int l, int r){if (l == r) return l;
return l | ((1 << ( __lg(l ^ r) + 1)) - 1);}
int getand(int l, int r){if (l == r) return l;
return l & ((1ll << ( __lg(l ^ r) + 1)) - 1);}
inline int lowbit(int x){return x&(-x);}
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
int lcm(int a,int b){return a*b/gcd(a,b);}
const double pi=acos(-1);
const int N=2e6+10;
const int mod=1e9+7;
int a[N],b[N];

void solve(){
   int n;cin>>n;
   for(int i=1;i<=n;i++) cin>>a[i];
   stack<int> s1,s2;
   int cnt1=0,cnt2=0,ans1=0,ans2=0;
   MAP mp;
   for(int i=1;i<=n;i++){
      int flag=0;
    while(s1.size()&&s1.top()<a[i]) s1.pop(),cnt1++,flag=1;
    if(flag==1)ans1+=cnt1;
    else cnt1=0;
    //if(s1.size()&&a[i]==s1.top()) mp[i]=1;
    s1.push(a[i]);
   }
   //cout<<ans1<<endl;
   reverse(a+1,a+1+n);
   for(int i=1;i<=n;i++){
      int flag=0;
    while(s2.size()&&s2.top()<a[i]) s2.pop(),cnt2++,flag=1;
    if(s2.size()&&a[i]==s2.top()){
      continue;
    }
    if(flag==1)ans2+=cnt2;
    else cnt2=0;

    s2.push(a[i]);
   }
   cout<<ans1+ans2<<endl;
}
signed main()
{
    ios;
    int t=1;
    cin>>t;
    while(t--){
       solve(); 
    }
    return 0;
}