#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  ll t, n, m;
  cin >> t;
  while (t--) {
    cin >> n;
    ll a[n];
    unordered_map<ll, ll> mp;
    for (ll i = 0; i < n; i++) {
      cin >> a[i];
      mp[a[i]]++;
    }
    ll p = a[mp[a[0]]];
    ll g = a[0], c = 0, ans = 2;
    ll arr[3] = {0};
    if (a[n / 2 - 1] == a[n / 2]) c = 1;
    if (mp[a[0]] >= n / 3) {
      cout << "0 0 0\n";
    } else {
      ll flag = 0;
      for (ll i = 0; i < n / 2; i++) {
        if (arr[2] == 0) {
          arr[2] += mp[a[i]];
          i += mp[a[i]] - 1;
          continue;
        }
        if (ans == 1) {
          if (arr[0] + arr[1] + arr[2] + mp[a[i]] > n / 2) break;
          arr[0] += mp[a[i]];
          i += mp[a[i]] - 1;
        } else {
          arr[1] += mp[a[i]];
          if (arr[1] + arr[2] >= n / 2) {
            flag++;
            break;
          }
          if (arr[1] <= arr[2]) ans++;
          ans--;
          i += mp[a[i]] - 1;
        }
      }
      if (arr[0] <= arr[2] || flag)
        cout << "0 0 0\n";
      else
        cout << arr[2] << " " << arr[1] << " " << arr[0] << "\n";
    }
  }
  return 0;
}
