#include <bits/stdc++.h>
#pragma GCC optimize "03"
using namespace std;
const long long int inf = INT_MAX;
const long long int MOD = 1e9 + 7;
const long long int N = 4e5 + 5;
long long int a[N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    long long int c = 1;
    vector<long long int> v;
    for (long long int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    for (long long int i = 2; i <= n; i++) {
      if (a[i] != a[i - 1]) {
        v.push_back(c);
        c = 1;
      } else
        c++;
      if (i == n / 2 + 1) break;
    }
    long long int ans = 0;
    if (v.size() < 3) {
      cout << "0 0 0\n";
      continue;
    }
    long long int a1 = v[0];
    long long int p = 1;
    long long int a2 = 0;
    while (a2 <= a1 && p < v.size()) {
      a2 += v[p++];
    }
    long long int a3 = 0;
    while (p < v.size()) a3 += v[p++];
    if (a1 < a2 && a2 <= a3)
      cout << a1 << " " << a2 << " " << a3 << '\n';
    else
      cout << "0 0 0" << '\n';
  }
  return 0;
}
