#include <bits/stdc++.h>
using namespace std;
void shift(vector<long long int> &a) {
  vector<long long int> q;
  int n = (int)((a).size());
  q.push_back(a[n - 1]);
  for (int i = 1; i < n; i++) {
    q.push_back(a[i - 1]);
  }
  a.clear();
  for (auto x : q) {
    a.push_back(x);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  t = 1;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    vector<long long int> a(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    long long int k = n / 2;
    vector<int> sg;
    for (int i = 0; i < n; i++) {
      long long int r = a[i];
      int j = i;
      while (a[++j] == r) {
        continue;
      }
      sg.push_back(j - i);
      i = j - 1;
    }
    vector<long long int> fin;
    long long int sum = 0;
    for (auto x : sg) {
      if (sum + x > k) {
        break;
      }
      sum += x;
      fin.push_back(x);
    }
    bool ok = 1;
    int g, s, b;
    if ((int)((fin).size()) < 3) {
      ok = 0;
    } else {
      g = fin[0];
      long long int f = 0;
      for (int i = 1; i < (int)((fin).size()); i++) {
        f += fin[i];
        if (f > g) {
          break;
        }
      }
      if (sum - g - f > g) {
        s = f;
        b = sum - g - f;
        ok = 1;
      }
    }
    if (ok) {
      cout << g << " " << s << " " << b;
    } else {
      cout << 0 << " " << 0 << " " << 0;
    }
    cout << "\n";
  }
}
