#include <bits/stdc++.h>
using namespace std;
void solve(int);
void YN(bool b) {
  if (b) {
    cout << "YES"
         << "\n";
    ;
  } else {
    cout << "NO"
         << "\n";
    ;
  }
};
void yn(bool b) {
  if (b) {
    cout << "Yes"
         << "\n";
    ;
  } else {
    cout << "No"
         << "\n";
    ;
  }
};
void queries() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) solve(i);
}
long long ceildiv(long long a, long long b) { return a / b + !!(a % b); }
const int maxn = 200200;
const long long mod = 1000000007;
const double pi = 3.14159265359;
void solve(int id) {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int g = 0, s = 0, b = 0;
  int last;
  for (int i = 0; i < n && g + s + b < n / 2; i++) {
    if (a[i] != a[0]) {
      last = i;
      break;
    }
    g++;
  }
  for (int i = last; i < n && g + s + b < n / 2; i++) {
    if (a[i] != a[last]) {
      last = i;
      break;
    }
    s++;
  }
  map<int, int> mp;
  int k = 0;
  for (int i = last; i < n && g + s + b < n / 2; i++) {
    mp[a[i]]++;
    k = i;
    b++;
  }
  b -= mp[a[k]];
  if (!g || !s || !b) {
    cout << "0 0 0"
         << "\n";
    ;
    return;
  }
  cout << g << " ";
  ;
  cout << s << " ";
  ;
  cout << b << "\n";
  ;
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  queries();
  ;
  return 0;
}
