#include <bits/stdc++.h>
using namespace std;
int arr[400007];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    vector<int> v;
    int n;
    scanf("%d", &n);
    int req = n / 2;
    for (int i = 0; i < n; i++) {
      scanf("%d", &arr[i]);
      if (i && arr[i] == arr[i - 1])
        v.back()++;
      else
        v.push_back(1);
    }
    int g = v[0];
    int ans = g;
    int s = 0, b = 0;
    int cnt = 1;
    while (s <= g && cnt < v.size()) {
      s += v[cnt];
      ans += v[cnt];
      cnt++;
    }
    while (b <= g && cnt < v.size()) {
      b += v[cnt];
      ans += v[cnt];
      cnt++;
    }
    while (ans < req && cnt < v.size()) {
      if (ans + v[cnt] <= req) {
        b += v[cnt];
        ans += v[cnt];
      } else
        break;
      cnt++;
    }
    if (g && s && b && ans <= req)
      printf("%d %d %d\n", g, s, b);
    else
      printf("0 0 0\n");
  }
  return 0;
}
