//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <complex>
#include <random>
#include <cassert>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
#define itn int
#define nit int
#define ll long long
#define ms multiset
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define re register
#define ri re int
#define il inline
#define pii pair<int,int>
#define cp complex<double>
#define vi vector<int>
#define ull unsigned long long
#define mem0(x) memset(x,0,sizeof(x))
#define mem0x3f(x) memset(x,0x3f,sizeof(x))
using namespace std;
//using namespace __gnu_pbds;
const double Pi=acos(-1);
namespace fastIO {
	template<class T>
	inline void read(T &x) {
		x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		if(fu)x=-x;
	}
	inline int read() {
		int x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		return fu?-x:x;
	}
	template<class T,class... Args>
	inline void read(T& t,Args&... args) {
		read(t);
		read(args...);
	}
	char _n_u_m_[40];
	template<class T>
	inline void write(T x) {
		if(x==0){
			putchar('0');
			return;
		}
		T tmp = x > 0 ? x : -x ;
		if( x < 0 ) putchar('-') ;
		int cnt = 0 ;
		while( tmp > 0 ) {
			_n_u_m_[ cnt ++ ] = tmp % 10 + '0' ;
			tmp /= 10 ;
		}
		while( cnt > 0 ) putchar(_n_u_m_[ -- cnt ]) ;
	}
	template<class T>
	inline void write(T x ,char ch) {
		write(x);
		putchar(ch);
	}
}
using namespace fastIO;
#define int long long
int n,a[1000002],I;
ll x,y,z;
vector<int>v;
bool aa,b;
bool vis[1000002];
inline void solve(int now){
	if(n&1){
		if(aa&b)z+=now;
		else if(aa)x+=(now+1)>>1,y+=now>>1;
		else x+=now>>1,y+=(now+1)>>1;
		return;
	}
	if(aa&&b)z+=now;
	else if(aa)x+=now;
	else y+=now;
}
inline void dfs(int pos,int now){
	assert(a[pos]);
	if(vis[pos]){
		assert(pos==I);
		if((now&n)&1)aa=b=true;
		solve(now);
		return;
	}
	if(pos+(now&n)&1)aa=true;
	else b=true;
	vis[pos]=true;
	v.push_back(now);
	dfs((pos+a[pos]-1)%n+1,now+(pos+a[pos]-1)/n);
}
signed main() {
	F(asdf,1,read()){
		read(n);x=y=z=0;
		F(i,1,n)read(a[i]),vis[i]=false;
		F(i,1,n)if(!vis[i]&&a[i])I=i,aa=b=false,v.clear(),dfs(i,0);
	//	if(n&1)z+=x,z+=y,x=y=0;
		write(x,' ');write(y,' ');write(z,'\n');
	}
	return 0;
}