#include <bits/stdc++.h>
using namespace std;
int t, n, m, j, g, s, b, k, v[1000010];
int main() {
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 1; i <= n; i++) {
      cin >> v[i];
    }
    m = n / 2;
    g = s = b = 0;
    while (m > 0 && v[m] == v[n / 2 + 1]) {
      m--;
    }
    j = 1;
    for (int i = 1; i <= m / 3; i++) {
      if (v[i] != v[i + 1]) {
        j = max(j, i + 1);
        while (j - i <= i || v[j + 1] == v[j]) {
          j++;
        }
        k = m - j;
        if (i < min(j - i, k)) {
          g = i;
          s = j - i;
          b = k;
        }
      }
    }
    cout << g << " " << s << " " << b << "\n";
  }
}
