#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define yn(ans) printf("%s\n", (ans)?"Yes":"No")
#define YN(ans) printf("%s\n", (ans)?"YES":"NO")
#define Yn(ans) printf("%s\n", (ans)?"Yes":"No")
#define pn printf("\n")

void print(ll x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)print(x/10);
    putchar(x%10+'0');
}
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
    return x*f;
}
const int mod=1e9+7; 
// const int N=1e6+5;
const int N=15;
int l[N];
int r[N];
int a[N];
int tt[N];
void solve(){
    int n=read();
    ll ans=0;
    int top=0;
    for(int i=1;i<=n;++i){
        a[i]=read();
    }
    tt[top=0]=0;
    for(int i=1;i<=n;++i){
        while(top&&a[i]>a[tt[top]])--top;
        l[i]=tt[top];
        tt[++top]=i;
    }
    tt[top=0]=n+1;a[n+1]=-1;
    for(int i=n;i>=1;--i){
        while(top&&a[i]>a[tt[top]])--top;
        if(a[i]==a[tt[top]])r[i]=i;
        else r[i]=tt[top]-1;
        tt[++top]=i;
    }
    for(int i=1;i<=n;++i){
        ans+=r[i]-l[i]-1;
    }
    print(ans);pn;
}
int main()
{
    int t=read();
    while(t--){
        solve();
    }
    return 0;
}