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

#define ull unsigned long long
#define int long long
#define pii pair<int,int>

struct P {
    array<int,8> c;

    P() {
        for (auto &x : c) {
            x = 0;
        }
    }

    int val() {
        int ans = 0;
        int k = 1;
        for (int i = 0; i < 8; i++) {
            ans += k*c[i];
            k*=3;
        }
        return ans;
    }

    void clear() {
        fill(c.begin(), c.end(), 0);
    }

    bool exist() {
        for (auto x : c) {
            if (x < 0) return 0;
        }
        return 1;
    }

    P change() {
        P tmp;
        for (int i = 0; i < 8; i++) {
            tmp.c[i] = c[i]%3;
        }
        return tmp;
    }

    P operator-(P &t) {
        P tmp;
        for (int i = 0; i < 8; i++) {
            tmp.c[i] = c[i]-t.c[i];
        }
        return tmp;
    }

    const bool operator<(P &t) {
        return c < t.c;
    }
};

vector<P> vt;

void init() {
    P p;
    for (int i = 0; i < 729; i++) {
        int tmp = i;
        p.clear();
        for (int j = 0; j < 6; j++) {
            int q = tmp%3;
            for (int k = j; k < j+3; k++) {
                p.c[k]+=q;
            }
            tmp/=3;
        }
        // for (auto x : p.c) {
        //     cout << x << " ";
        // }
        // cout << endl;
        vt.push_back(p);
    }
}

vector<int> mp(6561,0);

void solve() {
    int n;
    cin >> n;
    vector<int> a(n+9);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i]--;
    }
    int ans = 0;
    
    for (auto p2 : vt) {
        fill(mp.begin(),mp.end(),0);
        P p,p0,p1;
        mp[p.val()]++;
        int l = 1,r;
        for (r = 1; r <= n; r++) {
            p.c[a[r]]++;p1.c[a[r]]++;
            while (l < r && (p-p2).exist()) {
                p.c[a[l]]--;
                p0.c[a[l]]++;
                mp[p0.change().val()]++;
                l++;
            }
            if ((p1-p2).exist()) {
                ans += mp[(p1-p2).change().val()];
            }
        }
    }
    cout << ans << endl;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    init();
    int t = 1;
    cin >> t;
    for (int i = 0; i < t; i++) {
        solve();
    }
    return 0;
}