#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 100);
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
void pr(long long x) { cout << x; }
void prl(long long x) { cout << x << "\n"; }
long long cbrt(long long x) {
  long long lo = 1, hi = min(2000000ll, x);
  while (hi - lo > 1) {
    long long mid = (lo + hi) / 2;
    if (mid * mid * mid < x) {
      lo = mid;
    } else
      hi = mid;
  }
  if (hi * hi * hi <= x)
    return hi;
  else
    return lo;
}
const long long dx[4] = {-1, 1, 0, 0};
const long long dy[4] = {0, 0, -1, 1};
long long XX[] = {-1, -1, -1, 0, 0, 1, 1, 1};
long long YY[] = {-1, 0, 1, -1, 1, -1, 0, 1};
const long long N = (long long)(1 * 1e5 + 10);
bool isPowerOfTwo(long long x) { return x && (!(x & (x - 1))); }
long long solve() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long ans = -1;
  for (long long i = n / 2 - 1; i >= 3; i--) {
    if (a[i] == a[i + 1]) continue;
    long long tot = i + 1;
    for (long long j = 0; j < i / 2; j++) {
      if (a[j] != a[j + 1]) {
        long long g = j + 1;
        long long s = 0;
        for (long long k = j + 1; k < i; k++) {
          s++;
          if (s <= g) continue;
          if (a[k] != a[k + 1]) break;
        }
        long long b = tot - (s + g);
        if (b > g && s > g) {
          cout << g << " " << s << " " << b << "\n";
          return 0;
        }
      }
    }
  }
  cout << "0 0 0\n";
  return 0;
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
}
