#include <bits/stdc++.h>
using namespace std;
int arr[4 * 100000 + 5], n, type, g, s, b, pointer;
bool solve() {
  pointer = -1;
  for (int i = 1; i <= n / 2; i++)
    if (arr[i] != arr[1]) {
      pointer = i;
      break;
    }
  if (pointer == -1) {
    return false;
  }
  g = pointer - 1;
  int t = 0;
  s = 0;
  for (int i = pointer; i <= n / 2; i++) {
    t++;
    if (arr[i] > arr[i + 1]) {
      s += t;
      t = 0;
      if (g < s) {
        pointer = i + 1;
        break;
      }
    }
  }
  t = 0;
  b = 0;
  for (int i = pointer; i <= n / 2; i++) {
    t++;
    if (arr[i] > arr[i + 1]) {
      b += t;
      t = 0;
    }
  }
  if (g >= s || g >= b) {
    return false;
  } else
    return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> arr[i];
    if (!solve())
      cout << 0 << ' ' << 0 << ' ' << 0 << '\n';
    else
      cout << g << ' ' << s << ' ' << b << '\n';
  }
}
