#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265359;
void nCr() {
  vector<vector<long long>> fac(1001, vector<long long>(1001, 1));
  for (int i = 0; i <= 1000; i++) {
    for (int j = 0; j <= i; j++) {
      if (j == 0 || j == i)
        fac[i][j] = 1;
      else
        fac[i][j] = (fac[i - 1][j - 1] + fac[i - 1][j]) % 1000000007;
    }
  }
}
long long apowb(long long a, long long b) {
  long long ans = 1;
  while (b > 0) {
    if (b % 2 == 0) ans = (ans * a) % 1000000007;
    a = (a * a) % 1000000007;
    b = b / 2;
  }
  return ans;
}
long long sub(long long a, long long b) {
  return ((a + 1000000007) % 1000000007 - (b + 1000000007) % 1000000007) %
         1000000007;
}
long long mul(long long a, long long b) {
  return ((a + 1000000007) % 1000000007 * (b + 1000000007) % 1000000007) %
         1000000007;
}
long long sum(long long a, long long b) {
  return ((a + 1000000007) % 1000000007 + (b + 1000000007) % 1000000007) %
         1000000007;
}
void solve() {
  int n;
  cin >> n;
  vector<int> p(n);
  for (int i = 0; i < n; i++) cin >> p[i];
  int k = n / 2;
  int r = k;
  for (int i = k - 1; i >= 0; i--) {
    if (p[i] == p[k]) {
      r--;
    } else
      break;
  }
  int g = 0, s = 0, b = 0;
  int st1 = 0;
  int st2 = 0;
  for (int i = 0; i < r; i++) {
    if (p[i] == p[0]) {
      g++;
    } else {
      if (st1 == 0) {
        st1 = i;
        s++;
      } else if (p[st1] == p[i]) {
        s++;
      } else {
        if (g >= s) {
          st1 = i;
          s++;
          continue;
        } else {
          b = r - i;
          break;
        }
      }
    }
  }
  if (g != 0 && s != 0 && b != 0 && g < s && g < b) {
    cout << g << " " << s << " " << b << endl;
  } else {
    cout << 0 << " " << 0 << " " << 0 << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}
