#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    int N;
    cin >> N;
    map<int, int> cnt;
    vector<int> A(N);
    for (int i = 0; i < N; i++) {
      cin >> A[i];
      cnt[A[i]]++;
    }
    int g = 0, s = 0, b = 0;
    int i = 0;
    while (i < N) {
      if (A[0] != A[i]) break;
      g++;
      i++;
    }
    while (i < N) {
      if (g < s) break;
      i++;
      s++;
    }
    while (i < N) {
      if (A[i - 1] != A[i]) break;
      i++;
      s++;
    }
    int sobran = (N % 2 == 0) ? N / 2 : (N - 1) / 2;
    sobran -= g;
    sobran -= s;
    while (i < N) {
      if (cnt[A[i]] <= sobran) {
        sobran -= cnt[A[i]];
        b += cnt[A[i]];
        i += cnt[A[i]];
        continue;
      }
      break;
    }
    if (b <= 0 || g >= s || g >= b) {
      g = s = b = 0;
    }
    cout << g << ' ' << s << ' ' << b << '\n';
  }
  return 0;
}
