#include <iostream>
#include <bitset>
#include <algorithm>
using namespace std;
const int N = 4e5 + 7;
int L[N], R[N];
bitset<N> vis;
struct Node { int x, c; } a[N], v[N];
int main() {
	int T, n;
	scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		vis.reset();
		int m = 0;
		for (int i = 1, x; i <= n; ++i) {
			scanf("%d", &x);
			if (x == v[m].x) ++v[m].c;
			else a[++m] = {x, i}, v[m] = {x, 1}, vis[m] = 1;
			L[i] = i - 1, R[i] = i + 1;
		}
		sort(a+1, a+m+1, [](Node &x, Node &y) { 
			return x.x<y.x || (x.x==y.x && x.c<y.c); 
		});
		int ct = 0;
		for (int i = 1; i < m; ++i) {
			int id = a[i].c, l = L[id], r = R[id];
			if (!vis[id]) continue;
			L[r] = l, R[l] = r, vis[id] = 0;
			if (!l && r>n) break;
			if (l && v[l].x<v[r].x) 
				v[l].c += v[id].c;
			else if (v[l].x==v[r].x) {
				v[l].c += v[id].c + v[r].c;
				r = R[r], L[r] = l, R[l] = r, vis[r] = 0; 
			} else v[r].c += v[id].c;
			ct += v[i].c;
		}
		printf("%d\n", ct);
	}
}