#include <bits/stdc++.h>
using namespace std;
map<int, int> num;
set<int> score;
int main() {
  int tc, n, g, s, b, solve[400005];
  cin >> tc;
  while (tc--) {
    cin >> n;
    g = s = b = 0;
    for (int i = 1; i <= n; i++)
      cin >> solve[i], num[solve[i]]++, score.insert(-1 * solve[i]);
    for (auto i = score.begin(); i != score.end(); i++) {
      if (g == 0) {
        g += num[-1 * *i];
      } else if (s <= g) {
        s += num[-1 * *i];
      } else if (b <= g || 2 * (g + s + b) <= n) {
        b += num[-1 * *i];
        if ((g + s + b) > (n / 2)) {
          b -= num[-1 * *i];
          break;
        }
      }
    }
    if (g + s + b > n / 2)
      cout << "0 0 0" << endl;
    else if (g >= s || g >= b)
      cout << "0 0 0" << endl;
    else
      cout << g << " " << s << " " << b << endl;
    score.clear();
    num.clear();
  }
}
