#include <bits/stdc++.h>
using namespace std;
vector<long long int> v;
long long int fep(long long int x, long long int y, long long int mod) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % mod;
    y = y >> 1;
    x = (x * x) % mod;
  }
  return res % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n, i, m, j, k, x, y, a, b, t, g, s;
  cin >> t;
  while (t--) {
    cin >> n;
    v.clear();
    if (n == 1) {
      cin >> x;
      cout << "0 0 0" << endl;
      continue;
    }
    for (i = 0; i < n; i++) {
      cin >> x;
      if (i < n / 2) v.push_back(x);
      if (i == n / 2) a = x;
    }
    while (v.back() == a) v.pop_back();
    reverse(v.begin(), v.end());
    g = -1;
    n = v.size();
    for (i = 1; i < n / 2; i++) {
      b = i + 1;
      if (v[n - i] == v[n - i - 1]) continue;
      a = upper_bound(v.begin(), v.end(), v[i]) - v.begin();
      s = n - i - a;
      if (i < s) {
        g = i;
        b = a;
        break;
      }
    }
    if (g == -1)
      cout << "0 0 0" << endl;
    else
      cout << g << " " << s << " " << b << endl;
  }
  return 0;
}
