#include <bits/stdc++.h>
using namespace std;
int a[400000 + 100];
vector<int> v;
int main() {
  int t;
  cin >> t;
  while (t--) {
    v.clear();
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    int num = 1;
    for (int i = 1; i <= n; i++) {
      if (a[i] == a[i + 1]) {
        num++;
      } else {
        v.push_back(num);
        num = 1;
      }
    }
    int jin = v[0];
    int yin = 0;
    int tong = 0;
    for (int i = 1; i < v.size(); i++) {
      yin += v[i];
      num = i;
      if (yin > jin) break;
    }
    for (int i = num + 1; i < v.size(); i++) {
      tong += v[i];
      num = i;
      if (tong > jin) break;
    }
    if (jin + tong + yin > n / 2) {
      cout << 0 << " " << 0 << " " << 0 << endl;
      continue;
    }
    for (int i = num + 1; i < v.size(); i++) {
      tong += v[i];
      if (jin + yin + tong > n / 2) {
        tong -= v[i];
        break;
      }
    }
    cout << jin << " " << yin << " " << tong << endl;
  }
  return 0;
}
