#include <bits/stdc++.h>
using namespace std;
long long int n;
void solve() {
  cin >> n;
  vector<long long int> arr(n);
  for (long long int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr.rbegin(), arr.rend());
  long long int g = 1, s = 0, b = 0;
  bool gl = false, sl = false, bl = false;
  for (long long int i = 1; i < n / 2; i++) {
    if (arr[i - 1] > arr[i]) {
      if (!gl) {
        gl = true;
        s++;
      } else {
        if (!sl) {
          sl = true;
          b++;
        } else {
          b++;
        }
      }
    } else {
      g++;
    }
  }
  long long int c = n / 2, i = (n / 2) - 1;
  while (b > 0 and i >= 0) {
    if (arr[c] == arr[i]) {
      i--;
      b--;
    } else {
      break;
    }
  }
  if (b == 0 or s == 0 or g == 0) {
    cout << "0 0 0\n";
  } else {
    cout << g << " " << s << " " << b << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
