#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 4e5 + 5;
int arrcy[maxn], num[maxn];
void test();
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int q;
  cin >> q;
  while (q--) test();
  return 0;
}
void test() {
  int cnt = 0, n, ccnt = 1;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arrcy[i];
  }
  for (int i = 1; i <= n + 1; i++) {
    if (arrcy[i] != arrcy[i - 1] || i == n) {
      num[cnt++] = ccnt;
      ccnt = 1;
    } else
      ccnt++;
  }
  int p = 0, ans1 = 0, ans2 = 0, ans3 = 0;
  ans1 = num[p++];
  while (p < cnt && ans2 <= ans1) ans2 += num[p++];
  while (p < cnt && (ans1 + ans2 + ans3 + num[p]) * 2 <= n) ans3 += num[p++];
  if (ans2 < ans1 || ans3 < ans1 || (ans1 + ans2 + ans3) * 2 > n) {
    cout << "0 0 0\n";
    return;
  } else
    cout << ans1 << " " << ans2 << " " << ans3 << "\n";
}
