#include <bits/stdc++.h>

using namespace std;
int p[1000000];
int q[1000000];

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n;
        cin >> n;
        bool flag=true;
        if(n<10) flag=false;
        int i=2;
        int j=1;
        cin >> p[1];
        while(i<=n/2)
        {

            cin >> p[i];
            if(p[i]!=p[i-1])
            {
                q[j]=p[i-1];
                j++;
            }
            i++;
        }
        while(i<=n)
        {cin >> p[i];i++;}
        if(p[n/2]!=p[n/2+1])
            q[j]=p[n/2];
        if(j<3) flag=false;
        if(flag)
        {
            int g=0;
            i=1;
            while(q[1]==p[i])
                {g++;i++;}
            j=2;
            int s=0;
            while(q[j]==p[i]||s<=g)
            {
                s++;
                if(p[i]!=q[j])
                    j++;
                i++;
            }
            int b=0;
            j++;
            while(q[j])
            {
                b++;
                if(q[j]!=p[i])
                    j++;
                i++;
            }
            b--;

            if(g>=b || g>=s && g+b+s>n/2) {g=0;s=0;b=0;}
            cout << g << ' ' << s << ' ' << b << '\n';
        }
        else cout << "0 0 0" << '\n';
        }
    }