#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, x;
    cin >> n;
    vector<int> v(n);
    set<int> p;
    for (int i = 0; i < n; i++) {
      cin >> x;
      v[i] = x;
      p.insert(x);
    }
    if (p.size() < 5)
      cout << 0 << " " << 0 << " " << 0 << endl;
    else {
      int i = n / 2;
      i -= 1;
      while (i >= 0 && (v[i] == v[i + 1])) i--;
      int g = 0, s = 0, b = 0, j = 0;
      while (v[0] == v[j] && j <= i) {
        g++;
        j++;
      }
      s = g + 1;
      j += s - 1;
      while (j <= i && v[j] == v[j + 1]) {
        j++;
        s++;
      }
      b = i - j;
      if (b <= g)
        cout << 0 << " " << 0 << " " << 0 << endl;
      else
        cout << g << " " << b << " " << s << endl;
    }
  }
}
