#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

template <int mod> struct static_modint {
    using mint = static_modint;
    int x;

    static_modint() : x(0) {}
    static_modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    mint &operator+=(const mint &rhs) {
        if ((x += rhs.x) >= mod) x -= mod;
        return *this;
    }
    mint &operator-=(const mint &rhs) {
        if ((x += mod - rhs.x) >= mod) x -= mod;
        return *this;
    }
    mint &operator*=(const mint &rhs) {
        x = (int)(1LL * x * rhs.x % mod);
        return *this;
    }
    mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }

    mint pow(long long n) const {
        mint _x = *this, r = 1;
        while (n) {
            if (n & 1) r *= _x;
            _x *= _x;
            n >>= 1;
        }
        return r;
    }
    mint inv() const { return pow(mod - 2); }

    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }
    friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint &lhs, const mint &rhs) { return lhs.x == rhs.x; }
    friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs.x != rhs.x; }

    friend ostream &operator<<(ostream &os, const mint &p) { return os << p.x; }
    friend istream &operator>>(istream &is, mint &a) {
        int64_t t;
        is >> t;
        a = static_modint<mod>(t);
        return (is);
    }
};

const unsigned int mod = 998244353;
using modint = static_modint<mod>;
modint mod_pow(ll n, ll x) { return modint(n).pow(x); }
modint mod_pow(modint n, ll x) { return n.pow(x); }

int dp[6561];

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    vector<vector<int>> v;
    vector<int> uo(8);
    auto dfs = [&](auto dfs, int i) -> void {
        if (i + 2 == 8) {
            v.push_back(uo);
            return;
        }
        for (int k = 0; k <= 2; k++) {
            uo[i] += k, uo[i + 1] += k, uo[i + 2] += k;
            dfs(dfs, i + 1);
            uo[i] -= k, uo[i + 1] -= k, uo[i + 2] -= k;
        }
    };
    dfs(dfs, 0);

    int q;
    cin >> q;
    while (q--) {
        memset(dp, 0, sizeof(dp));
        int n;
        cin >> n;
        vector<int> a(n);
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
        }
        auto calc = [&](vector<int> &cnt) -> int {
            int res = 0;
            for (int i = 0; i < 8; ++i) {
                res = res * 3 + cnt[i];
            }
            return res;
        };
        ll res = 0;
        vector<int> cnt(8), cnt2(8), tmp(8);
        dp[calc(cnt)] = 1;
        for (int i = 0; i < n; ++i) {
            cnt[a[i] - 1] += 1;
            cnt2[a[i] - 1] += 1;
            if (cnt2[a[i] - 1] == 3) {
                cnt2[a[i] - 1] = 0;
            }
            for (auto &x : v) {
                bool ok = true;
                for (int j = 0; j < 8; ++j) {
                    if (cnt[j] < x[j]) {
                        ok = false;
                        break;
                    } else {
                        tmp[j] = (cnt[j] - x[j]) % 3;
                    }
                }
                if (ok) {
                    res += dp[calc(tmp)];
                }
            }
            dp[calc(cnt2)] += 1;
        }
        cout << res << '\n';
    }
}