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

using i64 = long long;
using u64 = unsigned long long;
#define int long long
constexpr int N = 3e5 + 10;
constexpr int mod = 1e9 + 7;
constexpr int inf = 0x3f3f3f3f;
constexpr i64 infll = 0x3f3f3f3f3f3f3f3f;

#define debug(x) std::cerr << #x << " = " << x << std::endl
int a[N],l[N],r[N],stk1[N],stk2[N];
void solve(){
    int n;
    cin>>n;
    stk2[0]=n+1;stk1[0]=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    int ed1=0,ed2=0;
    for(int i=1;i<=n;i++)
    {
        while(ed1&&a[i]>a[stk1[ed1]])
        {
           ed1--; 
        } 
        l[i] = stk1[ed1] + 1;
        stk1[++ed1]=i;
    }
    for(int i=n;i>=1;i--)
    {
        if(ed2&&a[i]>a[stk2[ed2]])
        {
            ed2--;
        }  
        r[i] = stk2[ed2] - 1;
        if(a[r[i] + 1] == a[i])
            r[i] = i;
        stk2[++ed2]=i;
    }
    i64 ans = 0;
    for(int i=1;i<=n;i++) ans+=r[i]-l[i];
    cout<<ans<<'\n';
}
signed main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int t = 1;
    std::cin >> t;
    while(t--){

        solve();
    }
    return 0;
}