#include <bits/stdc++.h>
using namespace std;
long long power(long long b, long long e, long long m) {
  if (e == 0) return 1;
  if (e & 1) return b * power(b * b % m, e / 2, m) % m;
  return power(b * b % m, e / 2, m);
}
long long power(long long b, long long e) {
  if (e == 0) return 1;
  if (e & 1) return b * power(b * b, e / 2);
  return power(b * b, e / 2);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t, n;
  cin >> t;
  while (t--) {
    cin >> n;
    int a[n];
    map<int, char> m;
    char c = 'g';
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    m[0] = 'g';
    int g = 1, s = 1, b = 1, ind = -1;
    for (int i = 1; i < n; i++) {
      if (a[i - 1] != a[i]) {
        ind = i;
        break;
      } else {
        m[i] = 'g';
        g++;
      }
    }
    if (ind == -1 || ind > ((n / 2) - 1)) {
      cout << "0 0 0"
           << "\n";
      continue;
    } else {
      m[ind] = 's';
      for (int i = ind + 1; (i < n); i++) {
        if (a[i - 1] != a[i] && g < s) {
          ind = i;
          break;
        } else {
          m[i] = 's';
          s++;
        }
        if (i == (n - 1)) ind = n - 1;
      }
      if (ind == -1 || ind > ((n / 2)) || g >= s) {
        cout << "0 0 0"
             << "\n";
        continue;
      } else {
        m[ind] = 'b';
        for (int i = ind + 1; i < n; i++) {
          if (a[i - 1] != a[i] && g < b) {
            ind = i;
            break;
          } else {
            m[i] = 'b';
            b++;
          }
          if (i == (n - 1)) ind = n - 1;
        }
        if (ind == -1 || ind > ((n / 2)) || g >= b) {
          cout << "0 0 0"
               << "\n";
          continue;
        }
      }
    }
    if (g < b && g < s)
      cout << g << " " << s << " " << b << "\n";
    else {
      cout << "0 0 0"
           << "\n";
    }
  }
  return 0;
}
