#include <bits/stdc++.h>
using namespace std;

class BIT {
    vector<int> a;
    static int lowbit(int x) { return x & (-x); }

    int query(int p) {
        int r = 0;
        while (p) {
            r += a[p];
            p -= lowbit(p);
        }
        return r;
    }

public:
    BIT(int n) : a(n + 1) {}
    void add(int p, int x) {
        while (p < a.size()) {
            a[p] += x;
            p += lowbit(p);
        }
    }
    int query(int l, int r) {
        return query(r) - query(l);
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t; cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector<int> a(n);
        for (int &ai : a)
            cin >> ai;
        vector<vector<int>> p(n);
        for (int i = 0; i < n; ++i)
            p[a[i] - 1].push_back(i);
        vector<pair<int, int>> v;
        for (const auto &pi : p) {
            for (size_t i = 0; i < pi.size(); ++i) {
                if (pi.size() <= i + i + 1)
                    break;
                v.emplace_back(pi[pi.size() - i - 1] - pi[i], pi[i]);
            }
        }
        BIT bit(n);
        int64_t ans = 0;
        sort(v.begin(), v.end(), greater<>());
        for (auto [d, l] : v) {
            // [0, 1] -> [1, 2] -> (0, 2]
            // [l + 1, l + d - 1]
            ans += d - bit.query(l + 1, l + d);
            bit.add(l + 1, 1);
            bit.add(l + d + 1, 1);
        }
        cout << ans << '\n';
    }
    return 0;
}