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

const int N = 5e5 + 10;
int n , ans;
int a[N] , num[11] , X[15];
inline void solve() {
	int sum = 0; ans = 0;
	for(int i = 1;i <= n;i ++) {
		int sum = 0;
		for(int j = 1;j <= 8;j ++) num[j] = 0;
		for(int j = i;j <= n;j ++) {
			num[a[j]] ++; bool flag = 1;
			if((j - i + 1) % 3) continue;
			for(int k = 1;k <= 8;k ++) X[k] = num[k];
			for(int k = 1;k <= 8;k ++) {
//				if(X[k + 1] < 0) flag = 0;
				X[k] %= 3;
				if(X[k + 1] < X[k] || X[k + 2] < X[k]) {
					flag = 0; break;
				}
				else X[k + 1] -= X[k] , X[k + 2] -= X[k];
			}
			ans += flag;
		}
	}
	printf("%lld\n",ans);
}

signed main() {
//	freopen("shade.in","r",stdin);
//	freopen("shade.out","w",stdout);
	int t; cin >> t;
	while(t --) {
		scanf("%lld",&n);
		for(int i = 1;i <= n;i ++) {
			scanf("%lld",&a[i]);
		}
		solve();
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}
/*
5 4 1 1 1 1 6 1 2 3 1 2 3 7 6 5 8 7 6 3 2 8 1 2 1 2 1 2 1 3 9 2 2 4 4 1 1 1 3 3
*/