#include <bits/stdc++.h>
using namespace std;
const int N = 400005;
int T, n, a[N], pr[N], x, y, z;
int main() {
  cin >> T;
  while (T--) {
    x = y = z = 0;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", a + i);
    int k = n;
    while (k > n / 2) {
      int x = a[k];
      while (k && a[k] == x) k--;
    }
    n = k;
    k = 0;
    for (int i = 1; i <= n; i++) {
      if (i == 1 || a[i] != a[i - 1]) {
        k++;
        pr[k] = 0;
      }
      pr[k]++;
    }
    for (int i = 1; i <= k; i++) pr[i] += pr[i - 1];
    for (int i = 1; i <= k; i++) {
      int l, r, m, pos;
      pos = -1;
      l = i + 1;
      r = k;
      while (l <= r) {
        m = (l + r) / 2;
        if (pr[m] - pr[i] > pr[i]) {
          r = m - 1;
          pos = m;
        } else
          l = m + 1;
      }
      if (pos == -1 || pr[k] - pr[pos] <= pr[i]) continue;
      x = pr[i];
      y = pr[pos] - pr[i];
      z = pr[k] - pr[pos];
    }
    printf("%d %d %d\n", x, y, z);
  }
  return 0;
}
