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

typedef long long ll;

typedef pair<int, int> PII;

const int INF = 0x3f3f3f3f;

const int Mod = 1000000007;

int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };

bool prime(int x)
{
    if (x == 2) return true;

    else if (x == 1 || x % 2 == 0) return false;

    for (int i = 3; i <= sqrt(x) + 1; i++) if (x % i == 0) return false;

    return true;
}

void get_primes(int n,ll N)
{
    vector<int>primes(N);
    vector<bool>st(N); // 质数为fasle
    int cnt = 0;

    for (int i = 2; i <= n; i ++ )
    {
        if (!st[i]) primes[cnt++] = i;
        for (int j = 0; primes[j] <= n / i; j ++ )
        {
            st[primes[j] * i] = true;
            if (i % primes[j] == 0) break;
        }
    }
}

ll qmi(int a, int b, int p) // a ^ b % p
{
    ll res = 1 % p;
    while (b)
    {
        if (b & 1) res = res * a % p;
        a = a * (ll)a % p;
        b >>= 1;
    }
    return res;
}

int gcd(int a, int b) 
{
    if (b == 0) 
	{
        return a;
    } 
	else 
	{
        return gcd(b, a % b);
    }
}

int lcm(int a, int b) 
{
    return (a / gcd(a, b)) * b; 
}

void XJT___solve()
{
    int n;
    cin>>n;
    vector<int>v(n + 1),l(n + 1),r(n + 1);
    for(int i = 1;i <= n;i++) cin>>v[i];

    stack<int>st;
    for(int i = 1;i <= n;i++)
    {
        while(st.size() && v[i] > v[st.top()]) st.pop();

        if(!st.size()) l[i] = 1;
        else l[i] = st.top() + 1;

        st.push(i);
    }

    for(int i = n;i >= 1;i--)
    {
        while(st.size() && v[i] > v[st.top()]) st.pop();

        if(!st.size()) r[i] = n;
        else r[i] = st.top() - 1;

        if(v[r[i] + 1] == v[i]) r[i] = i;

        st.push(i);
    }

    int ans = 0;
    for(int i = 1;i <= n;i++) ans += r[i] - l[i];

    cout<<ans<<'\n';
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout.tie(0);

    int t = 1;
    cin >> t; 

    while (t--)
    {
        XJT___solve();
    }

    return 0;
}