#include <bits/stdc++.h>
using namespace std;

/* --------------- fast io --------------- */ // begin
namespace Fread {
const int SIZE = 1 << 21;
char buf[SIZE], *S, *T;
inline char getchar() {
	if (S == T) {
		T = (S = buf) + fread(buf, 1, SIZE, stdin);
		if (S == T) return '\n';
	}
	return *S++;
}
} // namespace Fread
namespace Fwrite {
const int SIZE = 1 << 21;
char buf[SIZE], *S = buf, *T = buf + SIZE;
inline void flush() {
	fwrite(buf, 1, S - buf, stdout);
	S = buf;
}
inline void putchar(char c) {
	*S++ = c;
	if (S == T) flush();
}
struct NTR {
	~ NTR() { flush(); }
} ztr;
} // namespace Fwrite
#ifdef ONLINE_JUDGE
#define getchar Fread :: getchar
#define putchar Fwrite :: putchar
#endif
namespace Fastio {
struct Reader {
	template<typename T>
	Reader& operator >> (T& x) {
		char c = getchar();
		T f = 1;
		while (c < '0' || c > '9') {
			if (c == '-') f = -1;
			c = getchar();
		}
		x = 0;
		while (c >= '0' && c <= '9') {
			x = x * 10 + (c - '0');
			c = getchar();
		}
		x *= f;
		return *this;
	}
	Reader& operator >> (char& c) {
		c = getchar();
		while (c == ' ' || c == '\n') c = getchar();
		return *this;
	}
	Reader& operator >> (char* str) {
		int len = 0;
		char c = getchar();
		while (c == ' ' || c == '\n') c = getchar();
		while (c != ' ' && c != '\n' && c != '\r') { // \r\n in windows
			str[len++] = c;
			c = getchar();
		}
		str[len] = '\0';
		return *this;
	}
	Reader(){}
} cin;
const char endl = '\n';
struct Writer {
	template<typename T>
	Writer& operator << (T x) {
		if (x == 0) { putchar('0'); return *this; }
		if (x < 0) { putchar('-'); x = -x; }
		static int sta[45];
		int top = 0;
		while (x) { sta[++top] = x % 10; x /= 10; }
		while (top) { putchar(sta[top] + '0'); --top; }
		return *this;
	}
	Writer& operator << (char c) {
		putchar(c);
		return *this;
	}
	Writer& operator << (char* str) {
		int cur = 0;
		while (str[cur]) putchar(str[cur++]);
		return *this;
	}
	Writer& operator << (const char* str) {
		int cur = 0;
		while (str[cur]) putchar(str[cur++]);
		return *this;
	}
	Writer(){}
} cout;
} // namespace Fastio
#define cin Fastio :: cin
#define cout Fastio :: cout
#define endl Fastio :: endl
/* --------------- fast io --------------- */ // end

typedef long long ll;

ll n;

bool check(ll i) {
	if (n * n % i != 0) {
		return false;
	}
	ll a = 3;
	ll b = -3 * i;
	ll c = i * i - n * n / i;
	if (b * b < 4 * a * c) {
		return false;
	}
	ll sr = sqrt(b * b - 4 * a * c);
	if (sr * sr != b * b - 4 * a * c) {
		return false;
	}
	if ((-b + sr) % (2 * a) == 0 && (-b + sr) / (2 * a) > 0 && (-b + sr) / (2 * a) < i) {
		cout << (-b + sr) / (2 * a) << " " << i - (-b + sr) / (2 * a) << endl;
		return true;
	}
	if ((-b - sr) % (2 * a) == 0 && (-b - sr) / (2 * a) > 0 && (-b - sr) / (2 * a) < i) {
		cout << (-b - sr) / (2 * a) << " " << i - (-b - sr) / (2 * a) << endl;
		return true;
	}
	return false;
}

vector<int> p, c;

bool dfs(int idx, ll val) {
	if (idx == (int)p.size()) {
		return check(val);
	}
	
	for (int i = 0; i <= 2 * c[idx]; ++i) {
		if (dfs(idx + 1, val)) {
			return true;
		}
		val *= p[idx];
		if (val > 2000000) {
			return false;
		}
	}
	
	return false;
}

void solve_case() {
	cin >> n;
	
	int nn = n;
	vector<int>().swap(p);
	vector<int>().swap(c);
	
	for (int i = 2; i * i <= n; ++i) {
		if (nn % i == 0) {
			p.push_back(i);
			c.push_back(0);
			while (nn % i == 0) {
				c.back()++;
				nn /= i;
			}
		}
	}
	if (nn > 1) {
		p.push_back(nn);
		c.push_back(1);
	}
	
//	for (int i = 0; i < (int)p.size(); ++i) {
//		cout << p[i] << " " << c[i] << endl;
//	}
	
	if (!dfs(0, 1)) {
		cout << "impossible" << endl;
	}
}

int main() {
	int t;
	cin >> t;
	while (t--) {
		solve_case();
	}
	return 0;
}