#include <bits/stdc++.h>
using namespace std;
const int MAXN = 400000;
int p[MAXN];
int t, n;
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) scanf("%d", p + i);
    int min_g = n;
    for (int i = 0; i < n; i++) {
      if (p[i] != p[0]) {
        min_g = i;
        break;
      }
    }
    int min_gns = min_g * 2 + 1;
    while (min_gns < n && p[min_gns - 1] == p[min_gns]) min_gns += 1;
    int max_all = n / 2;
    while (max_all > 0 && p[max_all - 1] == p[max_all]) max_all -= 1;
    if (max_all > min_gns + min_g) {
      cout << min_g << " " << min_gns - min_g << " " << max_all - min_gns
           << endl;
    } else {
      cout << "0 0 0" << endl;
    }
  }
}
