#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
priority_queue<int, vector<int>, greater<int>> q;
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, i;
    scanf("%d", &n);
    int a[n];
    for (int i = 0; i < n; i++) scanf("%d", &a[i]);
    int g = 0, s = 0, b = 0;
    i = 1;
    while (i < n && a[i] == a[i - 1]) i++;
    if (i >= n / 2 - 1) {
      cout << "0 0 0" << endl;
      continue;
    }
    g = i;
    i++;
    while (i < n && a[i] == a[i - 1]) i++;
    s = i - g;
    if (s + g >= n / 2) {
      cout << "0 0 0" << endl;
      continue;
    }
    while (s <= g && i < n) i++, s++;
    while (i < n && a[i] == a[i - 1]) s++, i++;
    if (s <= g || s + g >= n / 2) {
      cout << "0 0 0" << endl;
      continue;
    }
    int max = n / 2 - 1;
    while (max > 0 && a[max + 1] == a[max]) max--;
    b = max + 1 - (s + g);
    if (g != 0 && s != 0 && b != 0 && g < s)
      cout << g << " " << s << " " << b << endl;
    else
      cout << "0 0 0" << endl;
  }
  return 0;
}
