#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<int> me, ar;
  int t;
  cin >> t;
  while (t--) {
    me.clear();
    int n;
    cin >> n;
    ar.clear();
    for (int i = 0; i < n; i++) {
      int a;
      cin >> a;
      ar.push_back(a);
    }
    int count = 0;
    if (n == 1) {
      printf("0 0 0\n");
      continue;
    }
    for (int i = 0; i < (n / 2); i++) {
      if (ar[i] != ar[i + 1]) {
        me.push_back(count + 1);
        count = 0;
      } else
        count += 1;
    }
    int g = me[0], s = 0, b = 0;
    int ans = 0;
    if (me.size() > 1) {
      for (int i = 1; i < me.size(); i++) {
        s += me[i];
        if (s > g) {
          ans = i + 1;
          break;
        }
      }
    }
    for (int j = ans; j < me.size(); j++) {
      b += me[j];
    }
    if (b > g && me.size() > 2) {
      cout << g << " " << s << " " << b;
    } else
      cout << "0 0 0";
    cout << endl;
  }
}
