#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t-- > 0) {
    int n;
    cin >> n;
    vector<int> p(n + 1);
    for (int i = 1; i <= n; ++i) cin >> p[i];
    int o = 1, cnt = 1, b = 0, g = 0, s = 0;
    for (int i = 1; i <= n; ++i) {
      if (p[i] != p[i + 1] || i == n) {
        if (o == 1)
          g = cnt, ++o;
        else {
          if (s <= g)
            s += cnt;
          else if (b <= g)
            b += cnt;
        }
        cnt = 1;
      } else
        ++cnt;
    }
    if (!g || !b || !s || g + b + s > n / 2) g = b = s = 0;
    cout << g << " " << b << " " << s << endl;
  }
}
