#include <bits/stdc++.h>

using namespace std;
typedef long long LL;

void solve(){
	int n;
	cin >> n;
	vector<int> a(n * 3 + 1);
	for(int i = 1; i <= n; i++)cin >> a[i];
	
	for(int i = n + 1; i <= n * 3; i++)a[i] = a[i - n];
	
	reverse(a.begin() + 1 + n, a.begin() + 1 + n * 2);
	
	vector<LL> d(n * 3 + 1), ans(n * 3 + 1);
	int tt = 0;
	for(int i = n * 3; i >= 1; i--){
		if(!tt || a[i] < d[tt]){
			d[++tt] = a[i];
			ans[i] = tt;
		}
		else{
			int l = 1, r = tt;
			while(l <= r){
				int mid = (l + r) >> 1;
				if(a[i] <= d[mid])l = mid + 1;
				else r = mid - 1;
			}
			int rx = min(tt, r + 2);
			int lx = max(1, l - 2);
			for(int j = lx; j <= rx; j++){
				if(a[i] >= d[j]){
					ans[i] = j;
					d[j] = a[i];
					break;
				}
			}
			
		}
	}
	
	LL sum = 0;
	for(int i = 1; i <= n; i++){
		sum += ans[i] - 1;
	}
	
	cout << sum << endl;
}

int main(){
	int t;
	cin >> t;
	while(t--)solve();
}