#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++) cin >> arr[i];
    if (n < 6) {
      cout << 0 << " " << 0 << " " << 0 << endl;
      continue;
    }
    int index = (n / 2) - 1;
    while (index >= 0 && arr[index] == arr[index + 1]) index--;
    vector<int> count;
    int sum = 0;
    for (int i = index; i >= 0; i--) {
      int temp = 1;
      int j = i - 1;
      while (j >= 0 && arr[j] == arr[i]) {
        j--;
        temp++;
      }
      count.push_back(temp);
      sum += temp;
      i = j + 1;
    }
    if (count.size() < 3) {
      cout << 0 << " " << 0 << " " << 0 << endl;
      continue;
    }
    sum -= count[count.size() - 1];
    int g = count[count.size() - 1], s = 0, b = 0;
    bool ans = 0;
    for (int i = 0; i < count.size() - 1; i++) {
      b += count[i];
      s = sum - b;
      if (g < b && g < s) {
        ans = 1;
        break;
      }
    }
    if (ans == 1)
      cout << g << " " << s << " " << b << endl;
    else
      cout << 0 << " " << 0 << " " << 0 << endl;
  }
  return 0;
}
