#include void solve() { long long int n; scanf("%lld", &n); if (n % 8 > 0) { printf("-1\n"); return; } n /= 8; long long int a, b, c, d, s; if (n < 1665) { for (d = 0; 1111 * d <= n; d++) { for (c = 0; 1111 * d + 111 * c <= n; c++) { for (b = 0; 1111 * d + 111 * c + 11 * b <= n; b++) { a = n - 1111 * d - 111 * c - 11 * b; s = a + b + c + d; if (2 * a < s && 2 * b < s && 2 * c < s && 2 * d < s) { printf("%lld %lld %lld %lld\n", a, b, c, d); return; } } } } printf("-1\n"); } else { d = 0; c = 13; n -= 111 * 13; b = n / 12; a = n - 11 * b; printf("%lld %lld %lld %lld\n", a, b, c, d); } return; } int main() { int t; scanf("%d", &t); for (; t > 0; t--) solve(); return 0; }