#include<bits/stdc++.h>
const int N = 300005;
const int mod = 1e9 + 7;
using ll = long long;
using pr = std::pair<int, int>;
using std::cin;
using std::cout;
int n, m;
std::vector<int> pos[N];
int a[N];
int match[N];
int bit[N];
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	int T; cin >> T;
	for(int i = 1;i <= T;++i) {
		cin >> n;
		for(int i = 1;i <= n;++i) {
			cin >> a[i], pos[a[i]].push_back(i);
		}
		for(int i = 1;i <= n;++i) {
			for(int x = 0;x * 2 + 1 < (int) pos[a[i]].size();++x) {
				int A = pos[a[i]][pos[a[i]].size() - x - 1];
				int B = pos[a[i]][x];
				match[A] = B;
				match[B] = A;
			}
		}

		ll ans = 0;
		for(int i = 1;i <= n;++i) if(match[i]) {
			if(match[i] < i) {
				ans += i - match[i];
				for(int x = match[i];x;x &= x - 1) {
					ans -= bit[x];
				}
				for(int x = match[i];x <= n;x += x & -x) {
					bit[x] += 1;
				}
			} else {
				for(int x = i;x;x &= x - 1) {
					ans += bit[x];
				}
			}
		}
		cout << ans << '\n';
		for(int i = 1;i <= n;++i) {
			pos[i].clear();
			match[i] = 0;
			bit[i] = 0;
		}
	}
}