#include <bits/stdc++.h>
#include <cassert>
using namespace std;
using ll = long long int;
using u64 = unsigned long long;
using pll = pair<ll, ll>;
// #include <atcoder/all>
// using namespace atcoder;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define REPrev(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(coll) (coll).begin(), (coll).end()
#define SIZE(v) ((ll)((v).size()))
#define REPOUT(i, a, b, exp, sep) REP(i, (a), (b)) cout << (exp) << (i + 1 == (b) ? "" : (sep)); cout << "\n"

// @@ !! LIM()

int main(/* int argc, char *argv[] */) {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << setprecision(20);

  ll t0 = 1000;
  using sta = tuple<ll, ll, ll>;
  vector<sta> vec(t0, sta(-1, -1, -1));
  REP(i, 0, 22) REP(j, 0, 22) REP(k, 0, 22) {
    ll s = i + j + k;
    ll t = 111 * i + 11 * j + 1 * k;
    if (t < t0 and get<0>(vec[t]) < 0 and 2 * i < s and 2 * j < s and 2 * k < s) vec[t] = sta(i, j, k);
  }

  auto report = [&](ll i, ll j, ll k) -> void {
    cout << i << " " << j << " " << k << " " << "0\n";
  };

  auto solve = [&]() -> void {
    ll N; cin >> N;
    if (N % 8 != 0) {
      cout << -1 << "\n";
    }else {
      N /= 8;
      if (N < t0) {
        auto [i, j, k] = vec[N];
        if (i < 0) cout << -1 << "\n";
        else report(i, j, k);
      }else {
        ll a = 123 * 6 + N % 123;
        auto [i, j, k] = vec[a];
        ll base = (N - a) / 123;
        report(base + i, base + j, base + k);
      }
    }
  };

  ll T; cin >> T;
  REP(t, 0, T) solve();

  return 0;
}