#include <bits/stdc++.h>
using namespace std;
int main() {
  int T, p;
  cin >> T;
  for (p = 1; p <= T; p++) {
    int N;
    cin >> N;
    long long int A[N];
    int cnt = 0, count = 1, last;
    int i, j, k;
    for (i = 0; i < N; i++) cin >> A[i];
    vector<int> vect;
    k = (int)(N / 2);
    for (i = 1; i < N; i++) {
      if ((A[i] != A[i - 1]) || (i == N - 1)) break;
    }
    if (i > k)
      cout << "0 0 0\n";
    else {
      vect.push_back(i);
      cnt = i;
      j = 2 * i;
      if (j + 1 >= k)
        cout << "0 0 0\n";
      else {
        for (j = j + 1; j < N; j++) {
          if (A[j] != A[j - 1]) break;
          if (j == k) break;
        }
        vect.push_back(j - i);
        cnt = j;
        for (i = j + 1; i < N; i++) {
          if ((A[i] != A[i - 1]) || (i == N - 1)) cnt = i;
          if (i == k) break;
        }
        vect.push_back(cnt - j);
        if ((vect[1] > vect[0]) && (vect[2] > vect[0]))
          cout << vect[0] << " " << vect[1] << " " << vect[2] << "\n";
        else
          cout << "0 0 0\n";
      }
    }
  }
  return 0;
}
