#include <bits/stdc++.h>
using namespace std;
int T, n, p[400005], sum, ans1, ans2, i;
int main() {
  cin >> T;
  while (T--) {
    cin >> n;
    for (i = 1; i <= n; ++i) {
      cin >> p[i];
    }
    ans1 = ans2 = sum = 0;
    for (i = n / 2; i; --i) {
      if (p[i] != p[i + 1]) {
        sum = i;
        break;
      }
    }
    for (i = 1; i < (sum + 1) / 3; ++i) {
      if (p[i] != p[i + 1]) {
        ans1 = i;
        break;
      }
    }
    for (i = ans1 * 2 + 1; i < sum - ans1; ++i) {
      if (p[i] != p[i + 1]) {
        ans2 = i;
        break;
      }
    }
    sum -= ans2;
    ans2 -= ans1;
    if (ans1 > 0 && ans2 > 0 && sum > 0 && ans1 < ans2 && ans1 < sum &&
        ans1 + ans2 + sum <= n / 2 && p[ans1] > p[ans1 + 1] &&
        p[ans2 + ans1] > p[ans2 + ans1 + 1])
      cout << ans1 << " " << ans2 << " " << sum << "\n";
    else
      cout << 0 << " " << 0 << " " << 0 << "\n";
  }
}
