#include <bits/stdc++.h>
using namespace std;
inline void using_file(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}
mt19937 gen_rand;
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &a) {
  os << "(";
  os << a.first << ", ";
  os << a.second;
  os << ")";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
  os << "{";
  bool was = false;
  for (auto &x : a) {
    if (was) {
      os << ", ";
    }
    was = true;
    os << x;
  }
  os << "}";
  return os;
}
template <typename T>
inline void debug(const char *sdbg, T x) {
  cerr << "The value of " << sdbg << " is " << x << "\n";
};
template <typename T, typename... U>
inline void debug(const char *sdbg, T h, U... t) {
  cerr << "The value of ";
  while (*sdbg != ',') {
    cerr << *sdbg++;
  }
  cerr << " is " << h << "\n";
  debug(sdbg + 1, t...);
  cerr << "\n";
}
template <typename T>
T abs(T x) {
  if (x < 0) {
    return -x;
  } else {
    return x;
  }
}
template <typename T>
T sqr(T x) {
  return x * x;
};
const long long INF_FOR_SHORT_TIME = (long long)(1e9);
template <typename T>
T mul(T a, T b, T m) {
  if (a <= INF_FOR_SHORT_TIME && b <= INF_FOR_SHORT_TIME) {
    return (a * b) % m;
  }
  T q = (long long)((long double)a * (long double)b / (long double)m);
  T r = a * b - q * m;
  return (r + 5 * m) % m;
}
template <typename T, typename U>
T binpow(T a, U n, T MOD) {
  T res = 1;
  while (n) {
    if (n & 1) {
      res = mul(res, a, MOD);
    }
    a = mul(a, a, MOD);
    n >>= 1;
  }
  return res;
};
template <typename T>
int sign(T x) {
  if (x < 0) {
    return -1;
  } else if (x > 0) {
    return 1;
  } else {
    return 0;
  }
};
template <typename T>
T gcd(T a, T b) {
  if (a > b) {
    swap(a, b);
  }
  while (a) {
    b %= a;
    swap(a, b);
  }
  return b;
};
template <typename T>
bool uin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
};
template <typename T>
bool uax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
};
void solve() {
  int n;
  cin >> n;
  vector<int> p(n);
  for (int i = 0; i < n; ++i) {
    cin >> p[i];
  }
  vector<int> a;
  int cur = -1;
  int cnt = 0;
  for (int i = 0; i < n; ++i) {
    if (p[i] == cur) {
      ++cnt;
    } else {
      if (cnt > 0) {
        a.push_back(i - 1);
      }
      cur = p[i];
      cnt = 1;
    }
  }
  if (cnt > 0) {
    a.push_back(n - 1);
  }
  int last = -1;
  int ind = 0;
  for (int pos : a) {
    if ((pos + 1) * 2 > n) {
      break;
    }
    last = ind++;
  }
  if (last < 2) {
    cout << "0 0 0\n";
    return;
  }
  vector<int> res = {0, 0, 0};
  int ans = 0;
  for (int g = 0; g + 1 < last; ++g) {
    int l = g + 1;
    int r = last;
    while (l + 1 < r) {
      int mid = (l + r) / 2;
      int all_cnt = (a[last] + 1) - (a[g] + 1);
      int cur_cnt = (a[mid] + 1) - (a[g] + 1);
      if (cur_cnt * 2 <= all_cnt) {
        l = mid;
      } else {
        r = mid;
      }
    }
    int cnt_g = (a[g] + 1);
    int cnt_s = (a[l] + 1) - (a[g] + 1);
    int cnt_b = (a[last] + 1) - (a[l] + 1);
    if (min({cnt_g, cnt_s, cnt_b}) > 0 && cnt_g < min(cnt_s, cnt_b) &&
        uax(ans, cnt_g + cnt_b + cnt_s)) {
      res = {cnt_g, cnt_s, cnt_b};
    }
  }
  for (int x : res) {
    cout << x << " ";
  }
  cout << "\n";
}
int main() {
  gen_rand.seed(time(0));
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int q;
  cin >> q;
  while (q--) {
    solve();
  }
  return 0;
}
