#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
int t, n;
int a[N];
int g, s, b;
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    bool flag = 0;
    g = s = b = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
    }
    int idx = 2;
    g = 1;
    int au = a[1];
    for (idx = 2; idx <= n; idx++) {
      if (a[idx] == a[idx - 1]) {
        g++;
      } else {
        break;
      }
    }
    int mn = n / 2;
    while (a[mn] == a[mn + 1] && mn > 1) {
      mn--;
    }
    int now = a[mn];
    for (int i = mn; i >= idx; i--) {
      if (a[i] == now) {
        b++;
      } else {
        if (b <= g) {
          b++;
          now = a[i];
        } else {
          break;
        }
      }
    }
    s = mn - g - b;
    int sum = g + s + b;
    if (g > s || g > b || sum * 2 > n || s <= 0 || b <= 0) {
      g = s = b = 0;
    }
    printf("%d %d %d\n", g, s, b);
  }
  return 0;
}
