#include <bits/stdc++.h>
using namespace std;
int p[400010];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> p[i];
    n /= 2;
    while (p[n] == p[n + 1]) n--;
    int g = 0, s = 0, b = 0;
    bool ok = true;
    for (int i = 1; i <= n; i++) {
      g++;
      if (i < n && p[i] != p[i + 1]) break;
    }
    for (int i = g + 1; i <= n; i++) {
      s++;
      if (i < n && p[i] != p[i + 1] && s > g) break;
    }
    b = n - g - s;
    if (!g || s <= g || b <= g)
      cout << "0 0 0" << endl;
    else
      cout << g << " " << s << " " << b << endl;
  }
  return 0;
}
