#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define LL long long
#define pii pair<int,int>
#define pll pair<LL,LL>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
LL read() {
	LL  x = 0,y = 1; char ch = getchar(); while (!isdigit(ch)) {if (ch == '-') y = -y; ch = getchar();}
	while (isdigit(ch)) {x = x*10+ch-'0'; ch = getchar();} return x*y;
}
namespace qiqi {
	const int N = 1e5+5,M = 4; int n,a[N],p[N],c[M];
	struct DSU {
		int fa[N],c[N]; LL sum[N];
		void init(int n) {
			rep(i,1,n) {
				fa[i] = i; sum[i] = a[i];
				c[i] = i&1 ? 1 : 2;
			}
		}
		int find(int x) {return x == fa[x] ? x : fa[x] = find(fa[x]);}
		void merge(int x,int y) {
			x = find(x); y = find(y); if (x == y) return;
			fa[y] = x; c[x] |= c[y]; sum[x] += sum[y];
		}
	} dsu;
	void main() {
		n = read();
		rep(i,1,n) {
			a[i] = read();
			p[i] = (i+a[i]-1)%n+1;
		}
		dsu.init(n);
		rep(i,1,n) dsu.merge(i,p[i]);
		rep(i,1,M-1) c[i] = 0;
		rep(i,1,n) if (i == dsu.fa[i]) {
			c[dsu.c[i]] += dsu.sum[i]/n;
		}
		rep(i,1,M-1) printf("%d ",c[i]); puts("");
	}
}
int main() {
	int T = read(); while (T--) qiqi::main(); return 0;
}