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

using ll = long long;
using pii = pair<int,int>;
const int MAXX = 2e5 + 10;
pii a[MAXX];
int b[MAXX];
int tr[MAXX];
int pre[MAXX];
int suf[MAXX];
int p;
int lowbit(int x){return x & (-x);}
void update(int x,int c){
    while(x <= p){
        tr[x] += c;
        x += lowbit(x);
    }
}
int query(int x){
    int res = 0;
    while(x){
        res += tr[x];
        x -= lowbit(x);
    }
    return res;
}
void solve(){
    int n;
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> a[i].first;
        b[i] = a[i].first;
    }
    sort(b + 1,b + n + 1);
    p = unique(b + 1,b + n + 1) - b - 1;
    for(int i = 1;i <= p;i++)tr[i] = 0;
    for(int i = 1;i <= n;i++){
        a[i].second = lower_bound(b + 1,b + p + 1,a[i].first) - b;
    }
    for(int i = 1;i <= n;i++){
        int x = a[i].second;
        if(x - 1)pre[i] = query(x - 1);
        else pre[i] = 0;
        update(1,-pre[i]);
        update(x,pre[i] + 1);
    }
    for(int i = 1;i <= p;i++)tr[i] = 0;
    for(int i = n;i >= 1;i--){
        int x = a[i].second;
        if(x - 1)suf[i] = query(x - 1);
        else suf[i] = 0;
        update(1,-suf[i]);
        update(x,suf[i] + 1);
        if(i + suf[i] < n && a[i + suf[i] + 1].second == x){
            suf[i] = 0;
        }
    }
    ll ans = 0;
    for(int i = 1;i <= n;i++){
        ans += pre[i] + suf[i];
    }
    cout << ans << "\n";
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
}