#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define db double
#define ve vector<int>
#define pa pair<int,int>
#define fr first
#define sd second
#define pb push_back
#define mp make_pair
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
#define N 1000010
int fa[N];
int find(int x) {return (x == fa[x] ? x : fa[x] = find(fa[x]));}
void sol()
{
	int n;
	cin >> n;
	vector<int>a(n), g(n, 0);
	vector<ll>s(n, 0);
	for (int i = 0; i < n; i ++)cin >> a[i];
	for (int i = 0; i < n; i ++)fa[i] = i;
	for (int i = 0; i < n; i ++)
	{
		fa[find(i)] = find((i + a[i]) % n);
	}
	for (int i = 0; i < n; i ++)if (a[i] & 1)g[find(i)] = 1;
	for (int i = 0; i < n; i ++)s[find(i)] += a[i];
	ll A = 0, b = 0, c = 0;
	for (int i = 0; i < n; i ++)if (find(i) == i)
		{
			assert(s[i] % n == 0);
			ll w = s[i] / n;
			if (g[i])c += w;
			else
			{
				if (i & 1)
				{
					if (n % 2 == 0)b += w;
					else b += w / 2, A += w / 2;
				}
				else
				{
					if (n % 2 == 0)A += w;
					else A += w / 2, b += w / 2;
				}
			}
		}
	cout << A << ' ' << b << ' ' << c << '\n';
}
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T; cin >> T;
	while (T --)sol();
	return 0;
}