#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long MOD = 998244353;
void solve() {
  int n;
  cin >> n;
  vector<long long> arr(n + 1);
  for (int i = 1; i <= n; i++) cin >> arr[i];
  arr.push_back(-1);
  vector<long long> b(1);
  int current = arr[1];
  int count = 1;
  long long sum = 0;
  for (int i = 2; i <= n + 1; i++) {
    if (arr[i] != current) {
      b.push_back(count);
      current = arr[i];
      count = 1;
    } else {
      count++;
    }
  }
  vector<long long> c(1);
  for (int i = 1; i < b.size(); i++) {
    sum += b[i];
    if (sum * 2 <= n) {
      c.push_back(b[i]);
    }
  }
  int m = ((long long)(c).size()) - 1;
  vector<long long> prefix(m + 1, 0);
  for (int i = 1; i < c.size(); i++) {
    prefix[i] = prefix[i - 1] + c[i];
  }
  sum = prefix[m];
  long long a1 = 0, b1 = 0, c1 = 0;
  long long total = 0;
  for (int i = 1; i <= m; i++) {
    total += c[i];
    if (m - i < 2) continue;
    long long val = total + (sum - total) / 2;
    int j = lower_bound(prefix.begin() + 1, prefix.end(),
                        total + (sum - total) / 2) -
            prefix.begin();
    if (j >= m) continue;
    long long x = prefix[j] - total;
    long long y = sum - prefix[j];
    if (x > total && y > total && x > 0 && y > 0) {
      a1 = total;
      b1 = x;
      c1 = y;
      break;
    }
    j++;
    if (j >= m) continue;
    x = prefix[j] - total;
    y = sum - prefix[j];
    if (x > total && y > total && x > 0 && y > 0) {
      a1 = total;
      b1 = x;
      c1 = y;
      break;
    }
  }
  cout << a1 << " " << b1 << " " << c1 << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
