#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
using namespace std;
const int N = 4e5 + 7;
const int M = 1e6 + 7;
const int INF = 1e9 + 8;
int a[N];
int ans[N];
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    int len = 0;
    int g = 0;
    int t = a[1];
    for (int i = 1; i <= n; i++) {
      if (a[i] == t)
        g++;
      else {
        ans[++len] = g;
        g = 1;
        t = a[i];
      }
    }
    int k = n / 2;
    int ans1 = 0;
    int sum = 0;
    for (int i = 1; i <= n; i++) {
      if (ans[i] + ans1 > k) break;
      ans1 += ans[i];
      sum++;
    }
    if (sum < 3)
      cout << "0 0 0" << endl;
    else {
      int kk1 = 0;
      int kk2 = 0;
      int sum2 = 0;
      for (int i = 2; i <= sum; i++) {
        kk1 += ans[i];
        if (kk1 > ans[1]) {
          sum2 = i + 1;
          break;
        }
      }
      for (int i = sum2; i <= sum; i++) kk2 += ans[i];
      if (kk2 == 0)
        cout << "0 0 0" << endl;
      else
        cout << ans[1] << " " << kk1 << " " << kk2 << endl;
    }
  }
  return 0;
}
