#include <iostream>
#include <cassert>

using namespace std;
typedef long long ll;
struct S {
    ll a,b,c,d;
};

void pri(S s){
    cout << s.a << " " << s.b << " " << s.c << " " << s.d << "\n";
}

void ch(S s,ll x){
    assert(s.a + s.b*11 + s.c*111 + s.d*1111==x);
}
const int B = 3000;
S ans[B + 10];
int main(){
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int i,t; cin >> t;
    for(i=0;i<=B;i++) ans[i] = {-1,-1,-1,-1};
    for(int a=0;a*1<=B;a++){
        for(int b=0;a + b*11<=B;b++){
            for(int c=0;a + b*11 + c*111<=B;c++){
                for(int d=0;a + b*11 + c*111 + d*1111<=B;d++){
                    int sum = a + b + c + d;
                    if(2*a<sum && 2*b<sum && 2*c<sum && 2*d<sum){
                        ans[a + b*11 + c*111 + d*1111] = {a,b,c,d};
                    }
                }
            }
        }
    }
    while(t){
        t--;
        ll n; cin >> n;
        if(n%8){
            cout << -1 << "\n";
            continue;
        }
        n /= 8;
        if(n<=B){
            if(ans[n].a==-1) cout << -1 << "\n";
            else{
                pri(ans[n]);
                ch(ans[n],n);
            }
        }else{
            ll x = n;
            ll a = 0,b = 0,c = 0,d = 0;
            while(n%3){
                d++; n -= 1111;
            }
            while(c==0 || n%12){
                c++; n -= 111;
            }
            assert(n>0);
            a = b = n/12;
            pri({a,b,c,d});
            ch({a,b,c,d},x);
        }
    }
}