#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool uax(T &x, T y) {
  return (y > x) ? x = y, true : false;
}
template <typename T>
inline bool uin(T &x, T y) {
  return (y < x) ? x = y, true : false;
}
string to_string(char c) { return "'" + string(1, c) + "'"; }
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
template <typename A>
string to_string(A);
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ": " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool f = false;
  string r = "{";
  for (auto x : v) {
    if (f) r += ", ";
    r += to_string(x);
    f = true;
  }
  return r += "}";
}
template <typename A>
string to_string(vector<vector<A>> v) {
  string r;
  for (auto x : v) r += "\n" + to_string(x);
  return r;
}
void err(istream_iterator<string>) { cerr << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " =: " << to_string(a) << "; ";
  err(++it, args...);
}
template <typename T>
void kek(T ans) {
  cout << ans << endl;
  exit(0);
}
int const MOD = 1e9 + 7;
long long const INF = 1e18 + 42;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    vector<int> a(n);
    map<int, int> frq;
    for (int &x : a) cin >> x, frq[x]++;
    int g = frq[a[0]];
    vector<int> b;
    int run = 0;
    for (int i = g; i < n; ++i) {
      if (a[i] != a[i - 1]) {
        b.push_back(run);
        run = 0;
      }
      run++;
    }
    b.push_back(run);
    int m = int((b).size());
    vector<int> ans = {0, 0, 0};
    int best = 0;
    for (int i = 1; i < m; ++i) b[i] += b[i - 1];
    for (int i = 1; i < m; ++i) {
      if (b[i] > g) {
        int cur = g + b[i];
        int need = n / 2 - cur;
        if (need > g) {
          int j = upper_bound(begin(b), end(b), b[i] + need) - begin(b);
          if (j > 0) {
            --j;
            if (b[j] > g) {
              if (uax(best, g + b[j])) ans = {g, b[i], b[j] - b[i]};
            }
          }
        }
      }
    }
    for (int x : ans) {
      cout << x << ' ';
    }
    cout << '\n';
  }
  return 0;
}
