#include <bits/stdc++.h>
using namespace std;
long long pw(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2 == 1)
    return (a * pw((a * a) % 1000000007, b / 2)) % 1000000007;
  else
    return (1 * pw((a * a) % 1000000007, b / 2)) % 1000000007;
}
void solve() {
  int n;
  cin >> n;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int g = 0, s = 0, b = 0;
  int f = 0;
  int c = 1;
  for (int i = 1; i < n; i++) {
    if (a[i] == a[i - 1]) {
      c++;
    } else {
      if (f == 0) {
        g = c;
        f = 1;
      } else if (f == 1) {
        s += c;
        if (s > g) f = 2;
      } else {
        b += c;
      }
      if (g + s + b > (n / 2)) {
        b -= c;
        break;
      }
      c = 1;
    }
  }
  if (g > 0 && b > 0 && s > 0 && g < b && g < s) {
    cout << g << " " << s << " " << b << endl;
  } else {
    cout << "0 0 0" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
