#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void testcase() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i <= (n - 1); ++i) cin >> v[i];
  if (n < 5) {
    cout << "0 0 0" << endl;
    return;
  }
  int limit = v[n / 2];
  int final = n / 2 - 1;
  for (int i = n / 2 - 1; i >= (0); --i) {
    if (v[i] == limit) {
      final--;
    } else {
      break;
    }
  }
  int pos = final + 1;
  int i = 1, g = 1, s = 0, b = 0;
  int val = v[0];
  while (i < n) {
    if (v[i] == val)
      g++;
    else
      break;
    i++;
  }
  while (i < n && s <= g) {
    s++;
    val = v[i++];
  }
  while (i < n && v[i] == val) s++, i++;
  while (i < n && b <= g) {
    b++;
    val = v[i++];
  }
  while (i < pos) b++, i++;
  if (g == 0 || s == 0 || b == 0 || g + s + b > pos || g >= s || g >= b) {
    cout << "0 0 0" << endl;
  } else {
    cout << g << " " << s << " " << b << endl;
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  if (1) cin >> t;
  while (t--) {
    testcase();
  }
  return 0;
}
