#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace std;
using namespace __gnu_pbds;

#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define ALL(v) (v).begin() , (v).end()
#define fast ios::sync_with_stdio(false); cin.tie(NULL);
const double eps = 1e-6;

/////////////////////////////////////////////

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

////////////////////////////////

#define int long long

void solve(){

	int n;
	cin>>n;
	int a[n];
	for(int i = 0 ; i < n ; ++i)
		cin>>a[i];

	int diff = 0;
	for(int i = 1; i < n ; ++i)
		if(a[i]!=a[i-1])
			++diff;
	if(diff < 3){

		cout<<"0 0 0\n";
		return;
	}

	int g = 0;
	int s = 0;
	int b = 0;
	int i = 0;

	for(i = 1 ; i < n ; ++i){

		if(a[i]!=a[i-1]){

			g = i;
			break;
		}
	}
	int id = i;
	++i;
	for(; i < n ; ++i){

		if(a[i]!=a[i-1] && (i-id) > g){

			s = i - id;
			break;
		}
	}

	id = i;
	
	for( ; i < n/2 ; ++i){

		if(b+1==g)
			break;
		if(a[i]==a[n/2])
			break;
		else ++b;
	}
	if(g+b+s <= n/2 && g!=0 && s!=0 && b!=0 && g < b && g < s){

		cout<<g<<" "<<s<<" "<<b<<endl;
	}
	else{

		cout<<"0 0 0\n";
	}
}

signed main(){

    fast;
    //freopen("output.txt" , "w" , stdout);
    int t = 1;
    cin>>t;
    for(int i = 1 ; i <= t; ++i){

    	solve();
    }
}
