#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

#define int long long

int const maxn = 1e5 + 5;
vector < pair < int, int > > g[maxn];
int bad[maxn], used[maxn], flag = 1, sum = 0, cnt = 0, mask;

void dfs(int v) {
    if (bad[v]) flag = 0;
    used[v] = 1;
    mask |= (1 << (v % 2));
    cnt--;
    for (auto [u, w] : g[v]) {
        if (!used[u]) {
            dfs(u);
        }
        cnt++, sum += w;
    }
}

main()
{
 	ios_base::sync_with_stdio(0); cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        int n, x;
        cin >> n;
        for (int i = 1; i <= n; i++) g[i] = {}, bad[i] = 0, used[i] = 0;
        for (int i = 1; i <= n; i++) {
            cin >> x;
            if (!x) bad[i] = 1;
            else {
                int nxt = (i + x - 1) % n + 1;
                g[i].push_back({nxt, x});
            }
        }
        int l = 0, r = 0, lr = 0, out = 1;
        for (int i = 1; i <= n; i++) {
            if (bad[i] || used[i]) continue;
            flag = 1, sum = 0, cnt = 0, mask = 0;
            dfs(i);
            if (cnt == 0 && flag) {
                assert(sum % n == 0);
                if (mask == 3) lr += sum / n;
                else if (mask == 1) l += sum / n;
                else r += sum / n;
            } else out = 0;
        }
        if (out) cout << r << " " << l << " " << lr << '\n';
        else cout << "0 0 0\n";
    }
	return 0;
}