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

const int N = 1e5+5;
int n, A[N];
bool vis[N];

void solve(){
    cin >> n;
    for (int i=0; i<n; ++i) cin >> A[i], vis[i]=false;
    int ans[3] = {0, 0, 0};

    for (int i=0; i<n; ++i) if (!vis[i]){
        if (0==A[i]){
            vis[i]=true; 
            continue;
        }

        if (A[i]%n==0){
            int res = A[i]/n;
            if (n%2==0) ans[i%2] += res;
            else{
                ans[i%2] += (res+1)/2;
                ans[(i+1)%2] += res/2;
            }
            continue;
        }

        int loops = 0;
        bool odd = false;
        int cur = i;
        while (!vis[cur]){
            int res = (cur+A[cur])/n;
            loops += res;
            if (A[cur]%2==1) odd=true;
            vis[cur]=true;
            cur = (cur+A[cur])%n;
        }

        if (!odd){
            // printf("n%2=%lld\n", n %2);
            if (n%2==0) ans[i%2] += loops;
            else{
                ans[i%2] += (loops+1)/2;
                ans[(i+1)%2] += loops/2;
            }
        }else ans[2] += loops;
    }

    cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << '\n';
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t; cin >> t; while (t--) solve();
    return 0;
}