#include <bits/stdc++.h>

using namespace std;

int main()
{
	int T, n;
	scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		if (__builtin_popcount(n) == 1) {
			puts("IMPOSSIBLE");
			continue;
		}
		int k = -1;
		for (int d = 2; d * d <= 2 * n; d++) { 
			if (2 * n % d) continue;
			if ((2 * n + d - d * d) % (2 * d)) continue;
			k = (2 * n + d - d * d) / (2 * d);
			break;
		}
		assert(k != -1);
		printf("%d = %d", n, k);
		int sum = k;
		for (int i = k + 1; sum != n; i++) {
			printf(" + %d", i);
			sum += i;
		}
		puts("");
	}
	return 0;
}