#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int n, m;
int a[N];
int main() {
  std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int flag;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
      if (i == (n / 2) + 1) flag = a[i];
    }
    int g = 1, s = 0, b = 0;
    int f = n / 2;
    for (int i = 2; i <= f; i++) {
      if (a[i] == a[i - 1])
        g++;
      else
        break;
    }
    for (int i = g + 1; i <= f; i++) {
      if (a[i] == flag)
        break;
      else if (a[i] == a[i - 1] || i - g - 1 <= g)
        s++;
      else
        break;
    }
    for (int i = g + s + 1; i <= f; i++) {
      if (a[i] == flag)
        break;
      else
        b++;
    }
    if (!g || !s || !b || g >= s || g >= b)
      cout << "0 0 0" << endl;
    else
      cout << g << ' ' << s << ' ' << b << endl;
  }
  return 0;
}
