#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t, ti;
ll gcd(ll a, ll b) {
	if (b == 0)return a;
	return gcd(b, a % b);
}
void solve() {
	scanf("%d",&t);
	if (t == 1)printf("1 1\n");
	else if (t == 2)printf("3 2\n");
	else if (t == 3)printf("2 1\n");
	else {
		ll dz = 100000, dm = 1, mi;
		for (int i = 1; i < t; i++) {
			ll z = (t + 1) / 2 ;
			z = i;
			ll h = t - z;
			ll fz = (1 + z) * z / 2 + h;
			ll fm = t - h;
			ll gcds = gcd(fz, fm);
			fz /= gcds, fm /= gcds;
			if (fz * dm < dz * fm)dz = fz, dm = fm, mi = i;
		}
		printf("%lld %lld\n", dz, dm);
	}
}
int main() {
	int T;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}