//From: ifffer_2137
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf 0x7fffffff
#define eb emplace_back
#define pii pair<int,int>
#define mkpr make_pair
#define fir first
#define sec second
inline int read(){
	char ch=getchar();int x=0,w=1;
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+ch-48,ch=getchar();return w==1?x:-x;
}
const int maxn=2e5+5;
int _;
int T;
long double calc(int x){return 1.0*(x*x-(T-1)*x+T*T+T)/(T*2);}
pii getans(int x,int y){return mkpr(x/__gcd(x,y),y/__gcd(x,y));}
signed main(){
	#ifndef ONLINE_JUDGE
		assert(freopen("data.in","r",stdin));
		assert(freopen("test.out","w",stdout));
	#endif
	_=read();
	while(_--){
		T=read();
		if(T==1){
			cout<<1<<' '<<1<<'\n';
			continue;
		}
		int a=(T-1)/2+1;pii ans;
		if(calc(a)<calc(a+1)) ans=getans(a*a-(T-1)*a+T*T+T,T*2);
		else ans=getans((a+1)*(a+1)-(T-1)*(a+1)+T*T+T,T*2);
		cout<<ans.fir<<' '<<ans.sec<<'\n';
	}
	return 0;
}