#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
using datas = pair<ll, ll>;
using ddatas = pair<double, double>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using pvec = vector<datas>;
using pmat = vector<pvec>;
const ll mod = 1000000007;
const ll inf = 1LL << 60;
const double PI = acos(-1);
const double eps = 1e-9;
template <class T>
inline bool chmax(T& a, T b) {
  bool x = a < b;
  if (x) a = b;
  return x;
}
template <class T>
inline bool chmin(T& a, T b) {
  bool x = a > b;
  if (x) a = b;
  return x;
}
void startupcpp() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
}
double distance(ddatas& x, ddatas& y) {
  double a = x.first - y.first, b = x.second - y.second;
  return sqrt(a * a + b * b);
}
ll modinv(ll a) {
  ll b = mod, u = 1, v = 0, t;
  while (b) {
    t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  return (u + mod) % mod;
}
ll moddevide(ll a, ll b) { return (a * modinv(b)) % mod; }
vec modncrlistp, modncrlistm;
ll modncr(ll n, ll r) {
  ll i, size = modncrlistp.size();
  if (size <= n) {
    modncrlistp.resize(n + 1);
    modncrlistm.resize(n + 1);
    if (!size) {
      modncrlistp[0] = modncrlistm[0] = 1;
      size++;
    }
    for (i = size; i < (ll)n + 1; i++) {
      modncrlistp[i] = modncrlistp[i - 1] * i % mod;
      modncrlistm[i] = modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n] * modncrlistm[r] % mod * modncrlistm[n - r] % mod;
}
ll modpow(ll a, ll n) {
  ll res = 1;
  while (n) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
ll gcd(ll a, ll b) {
  if (!b) return a;
  return (a % b == 0) ? b : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll countdigits(ll n) {
  ll ans = 0;
  while (n) {
    n /= 10;
    ans++;
  }
  return ans;
}
ll sumdigits(ll n) {
  ll ans = 0;
  while (n) {
    ans += n % 10;
    n /= 10;
  }
  return ans;
}
void judgement(int a) {
  if (a) {
    cout << "Yes"
         << "\n";
  } else {
    cout << "No"
         << "\n";
  }
  if (a) {
    cout << "YES"
         << "\n";
  } else {
    cout << "NO"
         << "\n";
  }
}
int main() {
  startupcpp();
  ll t;
  cin >> t;
  while (t--) {
    ll i, N, x;
    cin >> N;
    vec v(N), p, ans(3, 0);
    for (i = 0; i < (ll)N; i++) {
      cin >> v[i];
      if (!i || v[i] != v[i - 1]) {
        p.push_back(1);
      } else {
        p[p.size() - 1]++;
      }
    }
    if (N < 10 || p.size() < 4) {
      cout << "0 0 0\n";
      continue;
    }
    ans[0] = x = p[0];
    for (i = 1; i < (ll)p.size(); i++) {
      x += p[i];
      if (x * 2 > N) {
        if (!ans[2]) {
          cout << "0 0 0\n";
        } else {
          do {
            bool f = 0;
            for (auto outi : ans) {
              cout << (f ? " " : "") << outi;
              f = 1;
            }
            cout << "\n";
          } while (0);
        }
        break;
      }
      if (ans[0] >= ans[1]) {
        ans[1] += p[i];
      } else {
        ans[2] += p[i];
      }
    }
  }
  return 0;
}
