#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define otto auto
const int MAXN=1e6+10;
const int INF=1ll*1e7*1e9;
int T,N,M,K,P,Q;
int a[MAXN];
int vis[MAXN];
int ans[4];
void prepare(){
	scanf("%lld",&N);
	for(int i = 0;i < N;i++){
		scanf("%lld",&a[i]);
		vis[i] = 0;
	}
	ans[0] = ans[1] = ans[2] = 0;
	for(int i = 0;i < N; i++){
		if(vis[i]) continue;
		int flag[2] = {0,0};
		int len = 0;
		for(int u = i;!vis[u%N];u += a[u%N]){
			vis[u%N] = 1;
			flag[u&1] = 1;
			len += a[u%N];
		}
		if(flag[0] && flag[1]){
			ans[2] += len / N;
			continue;
		}
		if(flag[0]){
			if(N&1){
				ans[1] += len / N / 2;
				ans[0] += len / N / 2;
			}
			else{
				ans[0] += len / N;
			}
		}
		if(flag[1]){
			if(N&1){
				ans[0] += len / N / 2;
				ans[1] += len / N / 2;
			}
			else{
				ans[1] += len / N;
			}
		}
	}
	printf("%lld %lld %lld\n",ans[0],ans[1],ans[2]);
}

signed main(){
	//ios::sync_with_stdio(0);
	T=1;
	scanf("%lld",&T);
	while(T--){
	    prepare();
	}
	return 0;
}