#include <bits/stdc++.h>
using namespace std;
long long x[1000005], y[1000005], a[1000005];
int main() {
  long long int t;
  scanf("%lld", &t);
  while (t--) {
    long long n;
    scanf("%lld", &n);
    for (int i = 1; i <= n; i++) {
      scanf("%lld", &a[i]);
      x[a[i]]++;
    }
    if (n <= 10) {
      printf("0 0 0\n");
    } else {
      long long g = 0, s = 0, b = 0, mid = n / 2, u = 0;
      for (int i = 1; i <= n; ++i) {
        if (a[i] != a[i - 1]) {
          y[++u] = a[i];
        }
      }
      g = x[y[1]];
      long long int k = 2;
      while (s <= g && k <= u) {
        s = s + x[y[k]];
        k++;
      }
      while (g + s + b <= mid && k <= u) {
        b = b + x[y[k]];
        k++;
      }
      k--;
      b = b - x[y[k]];
      if (g + s + b > mid || g >= s || g >= b) {
        printf("0 0 0\n");
      } else {
        printf("%lld %lld %lld\n", g, s, b);
      }
    }
  }
}
