#include <bits/stdc++.h>
using namespace std;
const long long N = 4e5 + 5, INF = 1e9, mod = 1e9 + 7;
int n, arr[N];
void doWork() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> arr[i];
  vector<int> v;
  int cur = 1;
  for (int i = 1; i < n; i++) {
    if (arr[i] == arr[i - 1])
      cur++;
    else {
      v.push_back(cur);
      cur = 1;
    }
  }
  if (cur) v.push_back(cur);
  int g = v[0], s = 0, b = 0;
  int p = 1, h = n / 2;
  while (p < v.size()) {
    if (s <= g) {
      s += v[p];
      p++;
    } else if (b <= g) {
      b += v[p];
      p++;
    } else if (g + s + b + v[p] <= h) {
      b += v[p];
      p++;
    } else
      break;
  }
  if (g == 0 || s == 0 || b == 0 || b + s + g > h || g >= s || g >= b)
    cout << "0 0 0" << '\n';
  else
    cout << g << " " << s << " " << b << '\n';
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int test = 1;
  cin >> test;
  while (test--) doWork();
}
