#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128 i128;
i128 T,S;
struct frac{
	i128 x,y;
	bool operator <(const frac &ret)const{
		return x*1.0/y<ret.x*1.0/ret.y;
	}
};
frac ans;
frac get(i128 L){
	frac now={L*L*T-T*T*L+S,L};
	ans=min(ans,now);
	return now;
}
void solve(){
	ll _T;
	scanf("%lld",&_T);
	T=_T;
	S=T*(T+1)/2*T;
	ans.x=1e27,ans.y=1;
	i128 l=1,r=T,sz=(r-l)/3,m1=l+sz,m2=r-sz;
	while(l+10<=r){
		if(get(m1)<get(m2))
			r=m2-1;
		else l=m1+1;
		sz=(r-l)/3,m1=l+sz,m2=r-sz;
	}
	for(int i=l;i<=r;++i)
		get(i);
	ans.y*=T;
	i128 g=__gcd(ans.x,ans.y);
	ans.x/=g,ans.y/=g;
	ll x=ans.x,y=ans.y;
	printf("%lld %lld\n",x,y);
//	for(int L=1;L<=T;++L){
//		mn=min(mn,(L*L*T-T*T*L+S)*1.0/L);
//	}
//	printf("%.6lf",mn*1.0/T);
}
int main(){
	int T;cin>>T;
	while(T--)solve();
}
/*
1
1000000000
*/