#include <bits/stdc++.h>
using namespace std;
long long int mo = 1000000007;
long long int MO = 998244353;
long long int modpower(long long int a, long long int b) {
  long long int ans = 1;
  if (b == 0) {
    return 1;
  }
  if (b % 2 == 1) {
    ans = a;
  }
  long long int x = modpower(a, b / 2) % mo;
  ans *= (x * x) % mo;
  ans %= mo;
  return ans;
}
int main() {
  int k;
  cin >> k;
  while (k--) {
    int n;
    cin >> n;
    int x, y;
    cin >> x;
    vector<long long int> cat;
    long long int cum = 1, count = 1;
    for (int i = 1; i < n; i++) {
      cin >> y;
      if (cum > n / 2) continue;
      if (y != x) {
        if (cum) cat.push_back(count);
        count = 0;
      }
      x = y;
      count++;
      cum++;
    }
    cum = 0;
    for (auto i : cat) {
      cum += i;
    }
    if (cum < 5 || cat[0] * 3 + 2 > cum) {
      cout << "0 0 0" << endl;
      continue;
    }
    int g = 0, s = 0, b = 0;
    g = cat[0];
    int i = 1;
    while (s <= g && i < cat.size()) {
      s += cat[i];
      i++;
    }
    while (i < cat.size()) {
      b += cat[i];
      i++;
    }
    if (s <= g || b <= g) {
      cout << "0 0 0" << endl;
      continue;
    }
    cout << g << " " << s << " " << b << endl;
  }
  return 0;
}
