#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b % 2 != 0) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b /= 2;
  }
  return res;
}
long long ncr(long long n, long long k) {
  if (k > n - k) k = n - k;
  long long pro = 1;
  for (long long i = 0; i < k; i++) {
    pro = (pro * (n - i)) % 1000000007;
    pro /= (i + 1);
  }
  return (pro % 1000000007);
}
vector<long long> prime;
void seive() {
  vector<bool> isprime(2000001, true);
  for (int i = 2; i * i <= 2000000; i++) {
    if (isprime[i]) {
      for (int j = i * i; j <= 2000000; j += i) {
        isprime[j] = false;
      }
    }
  }
  for (int i = 2; i <= 1000000; i++) {
    if (isprime[i]) prime.push_back(i);
  }
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, n;
  cin >> t;
  while (t--) {
    cin >> n;
    vector<long long> arr(n);
    long long cnt = 0;
    map<long long, long long, greater<long long>> m;
    for (int i = 0; i < n; i++) cin >> arr[i];
    if (n < 3) {
      cout << "0 0 0" << endl;
      continue;
    }
    long long pos = n / 2;
    if (arr[pos] == arr[pos + 1]) {
      while (arr[pos] == arr[pos - 1]) {
        pos--;
      }
    }
    for (int i = 0; i < pos; i++) {
      m[arr[i]]++;
      cnt++;
    }
    if (m.size() < 3) {
      cout << "0 0 0" << endl;
      continue;
    }
    auto itr = m.begin();
    long long g = itr->second;
    itr++;
    long long s = 0, b = 0;
    while (itr != m.end() && s <= g) {
      s += itr->second;
      itr++;
    }
    while (itr != m.end()) {
      b += itr->second;
      itr++;
    }
    if (s > g && b > g)
      cout << g << " " << s << " " << b << endl;
    else
      cout << "0 0 0" << endl;
  }
  return 0;
}
