#include <bits/stdc++.h>
using namespace std;
vector<int> p;
int freq[1000000];
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      p.push_back(x);
    }
    int max = n / 2;
    int g, s, b;
    g = 0;
    s = 0;
    b = 0;
    if (max < 3)
      printf("0 0 0\n");
    else {
      while (p.size() != max + 1) p.pop_back();
      int x = p[max];
      while (p[p.size() - 1] == x) {
        p.pop_back();
      }
      if (p.size() < 3) printf("0 0 0\n");
      for (int i = p.size() / 3; i > 0; i--) {
        if (p[i] != p[i - 1]) {
          g = i;
          int e = p.size() - g;
          if (e % 2 == 0) {
            s = e / 2;
            b = e / 2;
          } else {
            s = e / 2;
            b = e / 2 + 1;
          }
          break;
        }
      }
      printf("%d %d %d\n", g, s, b);
    }
    p.clear();
  }
}
