#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    cin.tie(0)->sync_with_stdio(0);
    const int M = 855;
    vector<tuple<int, int, int>> can(M, tuple<int, int, int>(-1, -1, -1));
    repu(i, 1, 86) repu(j, 1, 80) repu(k, 1, 8) {
        int s = (i+j+k+1) / 2;
        if(i >= s || j >= s || k >= s) continue;
        int sum = i+11*j+111*k;
        if(sum >= M) continue;
        can[sum] = make_tuple(i, j, k);
    }

    int t;
    cin >> t;
    while(t--) {
        ll n;
        cin >> n;
        if(n % 8 != 0) {
            cout << "-1\n";
            continue;
        }
        n /= 8;
        if(n < M) {
            if(get<0>(can[n]) < 0) {
                cout << "-1\n";
                continue; 
            }
            auto[i, j, k] = can[n];
            cout << i << " " << j << " " << k << " 0\n";
            continue;
        }
        ll t = (n - 855);
        ll p = t / 12, q = t % 12;
        cout << 1 + p + q << " " << 7 + p << " " << 7 << " 0\n";
    }
    return 0;
}