#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int all[n], cont = 1, g = 0, s = 0, b = 0;
    vector<int> num;
    cin >> all[0];
    for (int i = 1; i < n; i++) {
      cin >> all[i];
      if (all[i] == all[i - 1])
        cont++;
      else {
        num.push_back(cont);
        cont = 1;
      }
    }
    num.push_back(cont);
    if (n >= 10) {
      int siz = num.size(), best = n / 2, maxg, ind = 0;
      best % 3 < 2 ? maxg = best / 3 - 1 : maxg = best / 3;
      while (ind < siz) {
        if (best - num[ind] < 0)
          break;
        else {
          best -= num[ind];
          ind++;
        }
      }
      best = n / 2 - best;
      if (ind < 3) {
        cout << 0 << ' ' << 0 << ' ' << 0 << '\n';
        continue;
      }
      int cur = 0;
      while (cur < ind) {
        if (g + num[cur] > maxg)
          break;
        else {
          g += num[cur];
          cur++;
        }
      }
      if (ind - cur < 2 || g == 0) {
        cout << 0 << ' ' << 0 << ' ' << 0 << '\n';
        continue;
      }
      for (int i = cur; i < ind - 1; i++) s += num[i];
      b += num[ind - 1];
    }
    cout << g << ' ' << s << ' ' << b << '\n';
  }
  return 0;
}
