#include <bits/stdc++.h>
using namespace std;
long long int mul(long long int x, long long int y) {
  long long int ans = 1;
  while (y > 0) {
    if (y & 1) ans = (ans * x) % 1000000007;
    y /= 2;
    x = (x * x) % 1000000007;
  }
  return ans;
};
long long int a[400005];
int main() {
  long long int t;
  scanf("%lld", &t);
  while (t--) {
    long long int n, i, g = 1, s = 0, b = 0;
    scanf("%lld", &n);
    for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
    for (i = 2; i <= n; i++)
      if (a[i - 1] != a[i])
        break;
      else
        ++g;
    if (g + 1 <= n) {
      ++s;
      for (i = g + 2; i <= n; i++)
        if (a[i - 1] == a[i] || s <= g)
          ++s;
        else
          break;
    }
    if (g + s + 1 <= n) {
      ++b;
      for (i = g + s + 2; i <= n; i++)
        if (a[i - 1] == a[i] || b <= g)
          ++b;
        else
          break;
    }
    if (g + s + b <= (n / 2) && g < s && g < b) {
      long long int last = g + s + b;
      for (i = g + s + b + 1; i <= (n / 2); i++)
        if (i + 1 <= n && a[i] > a[i + 1]) last = i;
      b += (last - (g + s + b));
      cout << g << " " << s << " " << b << "\n";
    } else
      cout << "0 0 0\n";
  }
  return 0;
}
