#include <bits/stdc++.h>
using namespace std;
int A[400010];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> A[i];
    vector<int> df;
    for (int i = 1; i <= n - 1; i++) {
      if (A[i] != A[i + 1] && i <= n / 2) {
        df.push_back(i);
      }
    }
    int cta = 0, ctb = 0, ctc = 0;
    int st = 0, cur = 0, prev = 0, mk = 0;
    for (int i = 0; i < df.size(); i++) {
      cur += df[i] - prev;
      prev = df[i];
      if (st == 0) {
        cta = cur;
        cur = 0;
        st++;
      }
      if (st == 1 && cur > cta) {
        ctb = cur;
        cur = 0;
        if (df[df.size() - 1] - df[i] > cta) {
          cout << cta << " " << ctb << " " << df[df.size() - 1] - df[i] << '\n';
        } else {
          mk = 1;
        }
        st = 2;
        break;
      }
    }
    if (st == 0 || st == 1 || mk == 1) {
      cout << 0 << " " << 0 << " " << 0 << '\n';
    }
  }
}
