#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream& operator<<(ostream& os, const pair<first, second>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream& operator<<(ostream& os, const map<first, second>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello&... rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const int mx = 4e5 + 5;
int p[mx];
vector<pair<int, int> > vec;
int n;
int g, s, b;
bool check(int len) {
  int sum1 = 0, sum2 = 0, sum3 = 0;
  for (int i = 0; i < len; ++i) sum1 += vec[i].second;
  sum2 += vec[len].second;
  int idx = (int)vec.size();
  for (int i = len + 1; i < (int)vec.size(); ++i) {
    if (sum2 > sum1) {
      idx = i;
      break;
    }
    sum2 += vec[i].second;
  }
  for (int i = idx; i < (int)vec.size(); ++i) {
    if ((sum1 + sum2 + sum3 + vec[i].second) * 2 > n) break;
    sum3 += vec[i].second;
  }
  g = sum1, s = sum2, b = sum3;
  return ((sum1 < sum2) && (sum1 < sum3));
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int t;
  cin >> t;
  while (t--) {
    vec.clear();
    cin >> n;
    for (int i = 0; i < n; ++i) cin >> p[i];
    int cur = p[0], cnt = 0;
    for (int i = 0; i < n; ++i) {
      if (cur == p[i]) {
        ++cnt;
      } else {
        vec.push_back(make_pair(p[i], cnt));
        cnt = 1;
        cur = p[i];
      }
    }
    vec.push_back(make_pair(cur, cnt));
    int lo = 1, hi = (int)vec.size() - 2, mid;
    while (lo <= hi) {
      mid = (lo + hi) / 2;
      if (check(mid))
        lo = mid + 1;
      else
        hi = mid - 1;
    }
    if (hi <= 0) {
      cout << "0 0 0" << '\n';
      continue;
    }
    check(hi);
    cout << g << " " << s << " " << b << '\n';
  }
}
