#include <bits/stdc++.h>
using namespace std;
bool isprime(long long a) {
  for (long long i = 2; i <= pow(a, 0.5); ++i) {
    if (a % i == 0) {
      return false;
    }
  }
  return true;
}
long long ceil(long long a, long long b) {
  long long c = (a + b - 1) / b;
  return c;
}
long long gcd(long long a, long long b) {
  if (a == 0) {
    return b;
  }
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long power_mod(long long a, long long b) {
  if (b == 0) {
    return 1;
  }
  long long temp = power_mod(a, b / 2);
  temp = (temp * temp) % 1000000007;
  if (b % 2) {
    temp = (temp * a) % 1000000007;
  }
  return temp;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> v(n);
    map<int, int> mapi;
    for (int i = 0; i < n; ++i) {
      cin >> v[i];
      mapi[v[i]]++;
    }
    if (n < 6 || mapi.size() < 3) {
      cout << 0 << ' ' << 0 << ' ' << 0 << "\n";
      continue;
    }
    long long g = 0, s = 0, b = 0;
    long long done = 0;
    vector<long long> arr;
    for (auto it : mapi) {
      arr.push_back(it.second);
    }
    reverse(arr.begin(), arr.end());
    for (int i = 0; i < arr.size() - 2; ++i) {
      g += arr[i];
      g = min(g, (n / 2) - 2);
    }
    long long rem = (n / 2) - g;
    s += (max(arr[n - 2], (rem - 1)));
    rem -= s;
    b = max(arr[n - 1], rem);
    cout << g << ' ' << s << ' ' << b << "\n";
  }
}
