#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const long long mod = 998244353;
int t;
int n, m, a[400005];
void no() { cout << 0 << " " << 0 << " " << 0 << '\n'; }
void solve() {
  cin >> n;
  for (int i = (int)0; i < (int)n; i = i + 1) cin >> a[i];
  ;
  int i = 0;
  m = n / 2;
  while (i < m && a[i] == a[0]) i++;
  if (i == m) return no();
  int cnt = 1;
  while (m > i && a[m - 1] == a[m]) m--;
  vector<int> v;
  a[m] = 1e9;
  for (int j = (int)i + 1; j < (int)m + 1; j = j + 1) {
    if (a[j] != a[j - 1]) {
      v.emplace_back(cnt);
      cnt = 1;
    } else {
      cnt++;
    }
  }
  cnt = 0;
  int j = 0;
  while (j < (int)v.size() && cnt <= i) {
    cnt += v[j];
    j++;
  }
  int s = cnt;
  cnt = 0;
  while (j < (int)v.size()) {
    cnt += v[j++];
  }
  if (s <= i || cnt <= i) return no();
  cout << i << " " << s << " " << cnt << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
