#include <bits/stdc++.h>
using namespace std;
const int N = (int)4e5 + 7;
int t;
int n;
int a[N];
bool good[N];
int ug[N];
int fi;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    for (int i = 1; i < n; i++) {
      good[i] = (a[i] != a[i + 1]);
    }
    fi = 0;
    for (int i = 1; i <= n / 2; i++) {
      if (good[i]) {
        fi = i;
      }
    }
    ug[n] = n + 1;
    for (int i = n - 1; i >= 1; i--) {
      if (good[i]) {
        ug[i] = i;
      } else {
        ug[i] = ug[i + 1];
      }
    }
    int ans = 0;
    int gg = 0;
    int ss = 0;
    int bb = 0;
    int mx = n / 2;
    for (int g = 1; g + (g + 1) + (g + 1) <= mx; g++) {
      if (good[g]) {
        if (ug[2 * (g + 1)] <= mx) {
          int s = ug[2 * (g + 1)] - g;
          if (ug[g + s + (g + 1)] <= mx) {
            int b = fi - g - s;
            int cur = g + s + b;
            if (cur > ans) {
              ans = cur;
              gg = g;
              ss = s;
              bb = b;
            }
          }
        }
      }
    }
    for (int i = 1; i < n; i++) {
      good[i] = 0;
    }
    cout << gg << " " << ss << " " << bb << "\n";
  }
}
