#include <bits/stdc++.h>
using namespace std;
void customrun() {}
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
long long powerwithmod(long long x, unsigned long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
bool comp(const pair<long long, long long> &a,
          const pair<long long, long long> &b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first > b.first;
}
void solve();
int main() {
  clock_t begin = clock();
  fast();
  customrun();
  long long t = 1;
  cin >> t;
  for (long long i = (1); i < (t + 1); i += (1)) {
    solve();
  }
  clock_t end = clock();
  double time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
  return 0;
}
void solve() {
  int n;
  cin >> (n);
  int arr[n];
  for (long long i = 0; i < n; i++) cin >> (arr[i]);
  if (n < 10) {
    cout << ("0 0 0\n");
    return;
  }
  int mn = arr[n / 2];
  int r = n / 2 - 1;
  for (long long i = 0; i < n; i++) {
    if (arr[i] <= mn) {
      break;
    }
    r = i;
  }
  int pt = 0;
  vector<int> pos;
  for (long long i = (1); i < (r + 1); i += (1)) {
    if (arr[i] < arr[i - 1]) ++pt, pos.push_back(i);
  }
  if (pt < 2) {
    cout << "0 0 0\n";
    return;
  }
  int ag, len = r + 1;
  if (len % 3 == 0) {
    ag = len / 3 - 1;
  } else
    ag = len / 3;
  int nmx = 0;
  for (long long i = 0; i < n; i++) {
    if (arr[i] == arr[0])
      ++nmx;
    else
      break;
  }
  if (nmx > ag) {
    cout << ("0 0 0\n");
    return;
  }
  cout << pos[0] << " ";
  int last = 0;
  for (int i = 1; i < pt; i++) {
    if (pos[i] - pos[0] > pos[0]) {
      cout << pos[i] - pos[0] << " " << r - pos[i] + 1 << "\n";
      return;
    }
  }
}
