#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int p[n];
    for (i = 0; i < n; i++) cin >> p[i];
    int max = n / 2;
    int g, s, b;
    vector<int> count1;
    int count = 1;
    for (i = 0; i < n - 1; i++) {
      if (p[i] == p[i + 1])
        count++;
      else {
        count1.push_back(count);
        count = 1;
      }
    }
    count1.push_back(count);
    vector<int>::iterator itr;
    int sum = 0;
    int flag = 0;
    for (itr = count1.begin(); itr != count1.end(); itr++) {
      sum = sum + *itr;
      flag++;
      if (sum > max) break;
    }
    flag--;
    sum = sum - *itr;
    g = s = b = 0;
    if (flag < 3) {
      g = s = b = 0;
    } else {
      int a[flag];
      i = 0;
      for (itr = count1.begin(); itr != count1.begin() + flag; itr++) {
        a[i++] = *itr;
      }
      g = a[0];
      i = 1;
      while ((i < flag) && (s <= g)) {
        s = s + a[i++];
      }
      if (i >= flag) {
        g = s = b = 0;
        cout << g << " " << s << " " << b << endl;
        continue;
      }
      while (i < flag) {
        b = b + a[i++];
      }
      if (b <= g) {
        g = s = b = 0;
        cout << g << " " << s << " " << b << endl;
        continue;
      }
    }
    cout << g << " " << s << " " << b << endl;
  }
  return 0;
}
