#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '/n'

void solve(){
    int n;
    cin>>n;
    vector<int>a={0};
    int ans = 0;
    for(int i = 1;i<=n;i++){
        int num;cin>>num;
        a.push_back(num);
    }
    stack<int>num;
    num.push(1);
    vector<int>change;
    for(int i = 2;i<=n;i++){
        while(num.size()&&a[i]>a[num.top()]){
            change.push_back(num.top());
            num.pop();
            ans++;
        }
        num.push(i);
        int cnt = 0;
        int last = -1;
        if(change.size())last = change[0];
        for(int i = 0;i<change.size();i++){
            if(last != a[change[i]])ans+=cnt;
            last = a[change[i]];
            cnt++;
            a[change[i]]=a[num.top()];
            num.push(change[i]);
        }
        change.clear();
    }
    int last = a[num.top()],cnt = 0;
    while(num.size()){
        if(last!=a[num.top()]){
            last = a[num.top()];
            ans+=cnt;
        }
        num.pop();
        cnt++;
    }
    cout<<ans<<endl;
}

signed main(){
    ios::sync_with_stdio(false);
    
    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}