#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9;
const long long N = 1e7 + 10;
void solve() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    vector<long long> cnt;
    int p = 1;
    for (int i = 1; i < n; i++) {
      if (a[i] != a[i - 1]) {
        cnt.push_back(p);
        p = 1;
      } else {
        p++;
        if (i == n - 1) cnt.push_back(p);
      }
    }
    long long sum = 0, q = 0;
    for (int i = 0; i < cnt.size(); i++) {
      if ((sum + cnt[i]) * 2 > n)
        break;
      else {
        sum += cnt[i];
        q++;
      }
    }
    int ok = 1;
    int g = 0, s = 0, b = 0;
    if (q < 3)
      ok = 0;
    else {
      g = cnt[0];
      sum = 0;
      int pos = -1;
      for (int i = 1; i < q; i++) {
        if (s > g) {
          pos = i;
          break;
        } else {
          s += cnt[i];
        }
      }
      if (pos != -1) {
        for (int i = pos; i < q; i++) {
          b += cnt[i];
        }
      }
      if (g == 0 || b == 0 || s == 0) {
        ok = 0;
      }
    }
    if (ok == 0) {
      g = ok, s = ok, b = ok;
    }
    cout << g << ' ' << s << ' ' << b << endl;
  }
}
int main() {
  solve();
  return 0;
}
