#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = INT_MAX;
long long mod = 1000000007;
vector<long long> gr[200001];
vector<long long> grev[200001];
long long a[200005];
void solve() {
  long long n;
  cin >> n;
  for (long long i = int(0); i < int(n); i++) cin >> a[i];
  long long b[3];
  b[0] = 1, b[1] = 0;
  b[2] = 0;
  long long x = 0;
  for (long long i = int(1); i < int(n / 2); i++) {
    if (a[i] == a[(n / 2)]) {
      continue;
    }
    if (a[i] == a[i - 1]) {
      b[x]++;
    } else {
      if (x == 1 && b[x] < b[x - 1] + 1) {
      } else if (x < 2)
        x++;
      b[x]++;
    }
  }
  if (b[0] == 0 || b[1] == 0 || b[2] == 0) {
    cout << "0 0 0"
         << "\n";
    return;
  }
  cout << b[0] << " " << b[1] << " " << b[2] << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
