#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const long long INF = 1e18;
long long a[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long cntr = -1;
    long long last = -1;
    for (int i = 0; i < n; i++) {
      long long x;
      cin >> x;
      if (x == last) {
        a[cntr]++;
      } else {
        cntr++;
        a[cntr] = 0;
        a[cntr]++;
      }
      last = x;
    }
    vector<long long> p;
    p.resize(cntr + 1);
    for (int i = 0; i <= cntr; i++) {
      if (i == 0) {
        p[i] = a[i];
        continue;
      }
      p[i] = p[i - 1] + a[i];
    }
    long long ag = 0;
    long long as = 0;
    long long ab = 0;
    long long curmax = 0;
    for (int i = 0; i <= cntr; i++) {
      long long g = p[i];
      long long s = 0;
      if (upper_bound(p.begin(), p.end(), 2 * g) == p.end() ||
          *upper_bound(p.begin(), p.end(), 2 * g) > n / 2) {
        break;
      } else {
        s = *upper_bound(p.begin(), p.end(), 2 * g);
      }
      long long b = 0;
      if (upper_bound(p.begin(), p.end(), s + g) == p.end() ||
          *upper_bound(p.begin(), p.end(), s + g) > n / 2) {
        break;
      } else {
        b = *upper_bound(p.begin(), p.end(), s + g);
      }
      long long mx = *(upper_bound(p.begin(), p.end(), n / 2) - 1);
      ag = g;
      as = s - g;
      ab = mx - ag - as;
    }
    cout << ag << " " << as << " " << ab << endl;
  }
}
