#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int T;
  cin >> T;
  while (T--) {
    long long int n, t = -1, g = 0, s = 0, b = 0, co = 0, i;
    vector<long long int> vv, v2;
    cin >> n;
    long long int arr[n + 1];
    for (i = 0; i < n; i++) {
      cin >> arr[i];
      if (i == 0) t = arr[i];
      if (arr[i] == t)
        co++;
      else {
        vv.push_back(co);
        co = 1;
      }
      t = arr[i];
    }
    vv.push_back(co);
    co = 0;
    for (i = 0; i < vv.size(); i++) {
      if ((vv[i] + co) <= (n / 2)) {
        v2.push_back(vv[i]);
      } else
        break;
      co += vv[i];
    }
    t = 0;
    co = 0;
    for (i = 1; i < v2.size(); i++) {
      if ((v2[0] < v2[i] + t)) {
        co++;
        if (co == 1) s = t + v2[i];
        if (co < 2)
          t = 0;
        else
          t += v2[i];
      } else
        t += v2[i];
    }
    b = t;
    if (v2.size() != 0) g = v2[0];
    if (co < 2)
      cout << "0 0 0" << endl;
    else {
      cout << g << " " << s << " " << b << endl;
    }
  }
}
