#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>

using namespace std;

typedef pair<int, int> PII;
const int N = 200010;

int T, n, a[N];
vector<PII> b;
PII e[N];
int l[N], r[N], idx;

// 初始化
void init()
{
    //0是左端点，1是右端点
    r[0] = 1, l[1] = 0;
    idx = 2;
}

// 在节点a的右边插入一个数x
void insert(int a, int x, int c)
{
    e[idx] = {x, c};
    l[idx] = a, r[idx] = r[a];
    l[r[a]] = idx, r[a] = idx ++ ;
}

// 删除节点a
void remove(int a)
{
    l[r[a]] = l[a];
    r[l[a]] = r[a];
}

bool cmp(const PII &aa, const PII &bb)
{
	if(aa.first == bb.first) return aa.second < bb.second;
	return aa.first < bb.first;
}


int main()
{
	cin >> T;
	while(T--)
	{
		memset(a, 0, sizeof(a));
		init();
		b.clear();
		int ans = 0;
		
		cin >> n;
		for(int i = 0; i < n; i++)
			cin >> a[i];
		
		for(int i = 0; i < n; i++)
		{
			int j = i;
			while(j < n && a[i] == a[j]) j++;
			b.push_back({a[i], idx});
			insert(l[1], a[i], j - i);
			i = j - 1;
		}
		
		sort(b.begin(), b.end(), cmp);
		
		//for(int i = r[0]; i != 1; i = r[i]) cout << e[i].first << ' ' << e[i].second << '|';
		
		for(auto it : b)
		{
			int ver = it.second;
			PII &cur = e[ver], &ll = e[l[ver]], &rr = e[r[ver]];
			if(ll.first > cur.first && rr.first > cur.first)
			{
				ans += cur.second;
				if(ll.first < rr.first)
					ll.second += cur.second;
				else
					rr.second += cur.second;
				remove(ver);
			}
			else if(ll.first > cur.first)
			{
				ans += cur.second;
				ll.second += cur.second;
				remove(ver);
			}
			else if(rr.first > cur.first)
			{
				ans += cur.second;
				rr.second += cur.second;
				remove(ver);
			}
			
		}
		
		cout << ans << endl;
	}
	return 0;
}