#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> p(n);
    for (int i = 0; i < n; i++) {
      cin >> p[i];
    }
    int mid = (n + 1) / 2;
    int j = mid - 1;
    while (j >= 0 && p[j] == p[mid]) j--;
    if (j < 4) {
      cout << "0 0 0" << endl;
      continue;
    }
    int g = 0, s = 0, b = 0;
    mid = j;
    j = 0;
    while (p[0] == p[j]) j++;
    g = j;
    if (mid - j + 1 < 2 * g + 2) {
      cout << "0 0 0" << endl;
      continue;
    }
    int end = mid;
    int start = j;
    j = start;
    while (j - start <= g || p[j] == p[start]) j++;
    s = j - start;
    b = end - j + 1;
    if (s <= g || b <= g) {
      cout << "0 0 0" << endl;
      continue;
    }
    cout << g << " " << s << " " << b << endl;
  }
  return 0;
}
