#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 5;
int n;
int p[maxn];
int main() {
  ios::sync_with_stdio(false);
  int T;
  cin >> T;
  while (T--) {
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> p[i];
    p[n + 1] = -1;
    p[0] = -1;
    int pos;
    for (int i = 1; i <= n; ++i) {
      if (p[i] != p[i + 1]) {
        pos = i;
        break;
      }
    }
    int g = pos, s = pos + 1, b = 0;
    for (int i = g + 1; i <= n; ++i)
      if (i - g > g) {
        if (p[i] != p[i + 1]) {
          s = i;
          break;
        }
      }
    for (int i = s + 1; i <= n; ++i) {
      if (p[i] != p[i + 1]) {
        b = i;
        break;
      }
    }
    if (max(g, max(s, b)) > n / 2) {
      puts("0 0 0");
      continue;
    }
    int x = n / 2 + 1;
    b = n / 2 - s;
    for (int i = x; i; --i) {
      if (p[i] != p[i - 1]) {
        break;
      }
      --b;
    }
    s -= g;
    printf("%d %d %d\n", g, s, b);
  }
  return 0;
}
