#include <bits/stdc++.h>
using namespace std;
const int maxn = 400005;
int a[maxn], n;
void solve() {
  cin >> n;
  map<int, int> H;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    H[-a[i]]++;
  }
  if (H.size() < 3) {
    cout << "0 0 0" << endl;
    return;
  }
  int flag = 0;
  int A = 0, B = 0, C = 0;
  for (auto x : H) {
    if (flag == 0) {
      if (A + B + C + x.second > n / 2) {
        break;
      }
      A = x.second;
      flag++;
    }
    if (flag == 1) {
      if (A + B + C + x.second > n / 2) {
        break;
      }
      B += x.second;
      if (B > A) {
        flag++;
      }
    }
    if (flag == 2) {
      if (A + B + C + x.second > n / 2) {
        break;
      }
      C += x.second;
    }
  }
  if (A == 0 || B == 0 || C == 0) {
    cout << "0 0 0\n";
  } else if (A >= B || A >= C) {
    cout << "0 0 0\n";
  } else {
    cout << A << " " << B << " " << C << endl;
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
