#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define x first
#define y second
#define ndl '\n'
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define bit __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;
using namespace __gnu_pbds;

template<typename T> using indexed_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<int, ull> piu;
typedef vector<vector<int>> matrix;

const ll INF = 1e18 + 123;
const ld EPS = 1e-9;
const int inf = 1e9 + 123;
const int MOD = 1e9 + 7;
const int N = 5e5 + 13;
const int M = 1e6 + 123;
const double pi = acos(-1.0);
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};

int p[N];

int main(){
    #ifdef KAZAKH
        freopen("input.txt", "r", stdin);
    #endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--){
        int n;
        cin >> n;
        for (int i = 1; i <= n; i++){
            cin >> p[i];
        }
        int g = 1;
        for (int i = 2; i <= n; i++){
            if (p[i]!= p[i-1]){
                break;
            }
            g++;
        }
        int s = 1;
        for (int i = g + 2; i <= n; i++){
            if (p[i]!= p[i-1] && s > g){
                break;
            }
            s++;
        }
        int b = 1;
        for (int i = g + s + 2; i <= n; i++){
            if (p[i]!= p[i-1] && b > g){
                break;
            }
            b++;
        }
        //cout << g << " " << s << " " << b<<ndl;
        if (g + s + b > n/2 || g >= s || g >= b){
            cout << "0 0 0" << ndl;
            continue;
        }
        else{
            cout << g << " " << s << " " << b<<ndl;
        }
    }
    return 0;
}
