#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
int p[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T, n, i, k1, k2, k3;
  cin >> T;
  while (T--) {
    cin >> n;
    for (i = 1; i <= n; ++i) cin >> p[i];
    for (k1 = 1; k1 <= n / 2; ++k1)
      if (p[k1] > p[k1 + 1]) break;
    if (k1 >= n / 2) {
      cout << "0 0 0" << endl;
      continue;
    }
    for (i = 2 * k1 + 1; i <= n / 2; ++i)
      if (p[i] > p[i + 1]) break;
    if (i >= n / 2) {
      cout << "0 0 0" << endl;
      continue;
    }
    k2 = i - k1;
    for (i = n / 2; i >= 1; --i)
      if (p[i] > p[i + 1]) break;
    k3 = i - k1 - k2;
    if (k1 > 0 && k1 < k2 && k1 < k3)
      cout << k1 << " " << k2 << " " << k3 << endl;
    else
      cout << "0 0 0" << endl;
  }
  return 0;
}
