#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long ans = 0;
    long long a[n];
    set<long long, greater<long long>> st;
    map<long long, long long> mp;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      mp[a[i]]++;
      st.insert(a[i]);
    }
    long long g = 0, s = 0, b = 0;
    long long z = n / 2;
    long long y = 0;
    long long j = 0;
    for (auto x : st) {
      if (j == 0) {
        g = mp[x];
        y = y + mp[x];
      } else if (s <= g) {
        s = s + mp[x];
        y = y + mp[x];
      } else {
        if (y + mp[x] <= z) {
          b = b + mp[x];
          y = y + mp[x];
        } else
          break;
      }
      if (y > z) {
        ans = -1;
        break;
      }
      j++;
    }
    if (b <= g) ans = -1;
    if (ans == -1)
      cout << "0 0 0";
    else
      cout << g << " " << s << " " << b;
    cout << endl;
  }
  return 0;
}
