#include <stdio.h>

int solve(long long N, long long ans[])
{
	if (N % 8 != 0) return 0;
	N /= 8;
	
	int i;
	long long sum, tmp;
	ans[2] = 1;
	ans[3] = 0;
	while (1) {
		tmp = N - ans[2] * 111 - ans[3] * 1111;
		if (tmp > 0) {
			ans[0] = tmp / 12 + tmp % 12;
			ans[1] = tmp / 12;
			sum = ans[0] + ans[1] + ans[2] + ans[3];
			if (ans[0] * 2 < sum && ans[1] * 2 < sum && ans[2] * 2 < sum && ans[3] * 2 < sum) return 1;
			
			if (ans[0] >= 11) {
				ans[0] -= 11;
				ans[1]++;
			}
			sum = ans[0] + ans[1] + ans[2] + ans[3];
			if (ans[0] * 2 < sum && ans[1] * 2 < sum && ans[2] * 2 < sum && ans[3] * 2 < sum) return 1;
		}
		
		if (ans[2] == 5) { // 5 is enough?
			if (ans[3] == 5) break;
			ans[2] = 0;
			ans[3]++;
		} else ans[2]++;
	}
	return 0;
}

int main()
{
	int T;
	long long N, ans[4];
	if (scanf("%d", &T) != 1) return -1;
	if (T < 1 || T > 88800) return -1;
	while (T--) {
		if (scanf("%lld", &N) != 1) return -1;
		if (N < 1 || N > 888000000000000000LL) return -1;
		if (solve(N, ans) == 0) printf("-1\n");
		else printf("%lld %lld %lld %lld\n", ans[0], ans[1], ans[2], ans[3]);
	}
	if (scanf("%d", &T) != EOF) return -1;
	fflush(stdout);
	return 0;
}