#include <bits/stdc++.h>
using namespace std;
const int N = 400005, M = 1005;
const long long MOD = 1e9 + 7;
const double eps = 1e-9;
const double PI = acos(-1.0);
int tc, n, m, p[N], G, S, B;
int main() {
  cin >> tc;
  while (tc--) {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> p[i];
    G = 0, S = 0, B = 0;
    G = 1;
    while (G < n && p[G] == p[0]) G++;
    if (G > n / 2) {
      puts("0 0 0");
      continue;
    }
    m = n / 2 - 1;
    if (p[m] == p[m + 1]) {
      while (m >= G && p[m] == p[m + 1]) m--;
    }
    if (m < G) {
      puts("0 0 0");
      continue;
    }
    bool f = 0;
    for (int i = G; i <= m; i++) {
      if (i - G > G && m - i + 1 > G && p[i - 1] > p[i]) {
        S = i - G;
        B = m - i + 1;
        f = 1;
      }
    }
    if (!f) G = S = B = 0;
    cout << G << " " << S << " " << B << endl;
  }
  return 0;
}
