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

int n,m;
const int N=1e6+10;
int a[N];
int l[N];
int r[N];
int ll[N],rr[N];
int main(){
    int t;
    cin>>t;
    while(t--)
    {
        int ans=0;
        int n;
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
        }
        for(int i=2;i<=n;i++)
        {
            if(a[i]>a[i-1])
            {
                l[i]=ll[i-1]+1;
            }
            else 
            {
                l[i]=0;
            }
            if(a[i]>=a[i-1])
            {
                ll[i]=ll[i-1]+1;
            }
        }
        for(int i=n-1;i>=1;i--)
        {
            if(a[i+1]<a[i])
            {
                r[i]=rr[i+1]+1;
            }
            else r[i]=0;
            if(a[i+1]<=a[i])
            {
                rr[i]=rr[i+1]+1;
            }
        }
        int an=0;
        for(int i=1;i<=n;i++)
        {
            an+=r[i]+l[i];
        }
        cout<<an<<endl;
    }
    return 0;
}