#include <bits/stdc++.h>
using namespace std;
int i, j, k, x, y, a, b, c, d, n, m, q, t, l, r, ans, res, sum, temp, T = 1;
void solve() {
  cin >> n;
  vector<int> arr;
  arr.resize(n);
  for (int i = 0; i < n; i++) cin >> arr[i];
  int g = 0, s = 0, b = 0;
  for (int i = 1; i < n; i++) {
    if (arr[i] == arr[i - 1]) continue;
    if (2 * i < n) {
      j = upper_bound(arr.begin(), arr.end(), arr[2 * i], greater<int>()) -
          arr.begin();
      if (j + i < n) {
        k = int(
            upper_bound(arr.begin(), arr.end(), arr[j + i], greater<int>()) -
            arr.begin());
        while (k < n &&
               int(upper_bound(arr.begin(), arr.end(), arr[k], greater<int>()) -
                   arr.begin()) < (n / 2))
          k = int(upper_bound(arr.begin(), arr.end(), arr[k], greater<int>()) -
                  arr.begin());
        if (k <= (n / 2)) {
          int tg = i, ts = j - i, tb = k - j;
          if (tg + ts + tb > g + s + b) g = tg, s = ts, b = tb;
        }
      }
    }
  }
  cout << g << " " << s << " " << b;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> T;
  while (T--) {
    solve();
    cout << '\n';
  }
  return 0;
}
