#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
inline void solve() {
  long long n, g = 0, s = 0, b = 0;
  cin >> n;
  vector<long long> a(n + 1);
  for (long long i = n; i > 0; i--) cin >> a[i];
  if (n < 10) {
    cout << "0 0 0" << '\n';
    return;
  }
  long long i = (n + 2) / 2, c = 1;
  while ((i <= n) and (a[i] == a[i - 1])) i++;
  n--;
  for (; n >= i; n--) {
    if (a[n] != a[n + 1]) {
      g = c;
      c = 1;
      break;
    }
    c++;
  }
  n--;
  for (; n >= i; n--) {
    if (a[n] != a[n + 1] and c > g) {
      s = c;
      b = (n - i + 1);
      break;
    }
    c++;
  }
  if (g >= b and g >= s) s = b = g = 0;
  cout << g << " " << s << " " << b << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long n = 1;
  cin >> n;
  while (n--) solve();
  return 0;
}
