#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
map<long long, long long> m;
signed main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long v[n];
    m.clear();
    for (long long i = 0; i < n; i++) {
      cin >> v[i];
      m[v[i]]++;
    }
    long long a = m[v[0]], b = 0, c = 0;
    long long j = 0;
    for (long long i = 0; i < n / 2; i++) {
      if (v[i] == v[n / 2]) break;
      j++;
    }
    if (j < a * 3 + 2) {
      cout << "0 0 0\n";
      continue;
    }
    for (long long i = a; i < j; i++) {
      if (v[i] >= v[a * 2 - 1]) b++;
    }
    if (b == a) {
      long long B = b;
      for (long long i = a + b; i < j; i++)
        if (v[i] == v[a + B]) b++;
    }
    for (long long i = a + b; i < j; i++) {
      c++;
    }
    if (b <= a || c <= a) {
      cout << "0 0 0\n";
      continue;
    }
    cout << a << ' ' << b << ' ' << c << '\n';
  }
}
