#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;}

        int loops=0;
        bool odd=false;
        int cur = i;

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

        if (!odd) ans[i%2] += loops;
        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;
}