#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using mint = modint998244353;

using T = array<ll, 4>;
map<ll, T> mp;

void precalc() {
    for(ll A = 0; A <= 1111; A++) {
        for(ll B = 0; B <= 101; B++) {
            for(ll C = 0; C <= 11; C++) {
                ll N = A * 8 + B * 88 + C * 888;
                if(2 * max({A, B, C}) >= (A + B + C)) continue;
                mp[N] = T{A, B, C, 0};
            }
        }
    }
}

void solve() {
    ll N;
    cin >> N;
    if(N % 8 != 0) {
        cout << -1 << "\n";
        return;
    }
    if(N < 8888) {
        if(mp.count(N)) {
            auto [A, B, C, D] = mp[N];
            cout << A << " " << B << " " << C << " " << D << "\n";
        }else {
            cout << -1 << "\n";
        }
    }else {
        ll p = N / 8888;
        ll q = (N % 8888) / 8;
        ll x = q / 12;
        ll A = 2 * p + q - 11 * x;
        ll B = 10 * p + x;
        ll C = 9 * p;
        ll D = 0;
        cout << A << " " << B << " " << C << " " << D << "\n";
        assert(8 * A + 88 * B + 888 * C + 8888 * D == N);
        assert(2 * max({A, B, C}) < (A + B + C));
    }
}

int main() {
    precalc();
    int T;
    cin >> T;
    while(T--) solve();
}