#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int main() {
    ll ub = 8888 * 6 + 888 * 6;

    vector<bool> aps(ub + 1, false);
    vector<ll> A(ub + 1, -1);
    vector<ll> B(ub + 1, -1);
    vector<ll> C(ub + 1, -1);
    vector<ll> D(ub + 1, -1);

    for (ll i = 0; i * 8888 <= ub; i++) {
        for (ll j = 0; j * 888 + i * 8888 <= ub; j++) {
            for (ll k = 0; k * 88 + j * 888 + i * 8888 <= ub; k++) {
                for (ll l = 0; l * 8 + k * 88 + j * 888 + i * 8888 <= ub; l++) {
                    if (l >= i + j + k) {
                        break;
                    }
                    bool pos = true;
                    if (i >= j + k + l) {
                        pos = false;
                    }
                    if (j >= i + k + l) {
                        pos = false;
                    }
                    if (k >= i + j + l) {
                        pos = false;
                    }
                    if (pos) {
                        ll val = l * 8 + k * 88 + j * 888 + i * 8888;
                        aps[l * 8 + k * 88 + j * 888 + i * 8888] = true;
                        D[val] = i;
                        C[val] = j;
                        B[val] = k;
                        A[val] = l;
                    }
                }
            }
        }
    }

    ll T;
    cin >> T;
    while (T--) {
        ll N;
        cin >> N;
        if (N % 8 != 0) {
            cout << -1 << endl;
            continue;
        }
        if (N < ub) {
            if (A[N] != -1) {
                cout << A[N] << " " << B[N] << " " << C[N] << " " << D[N]
                     << endl;
            } else {
                cout << -1 << endl;
            }
        } else {
            ll d = 6;
            ll c = 6;
            ll b = 0;
            ll a = (N - 8888 * 6 - 888 * 6) / 8;

            ll div = a / 12;

            a -= div * 11;
            b += div;
            cout << a << " " << b << " " << c << " " << d << endl;
        }
    }
}