#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int N=2e5+5;

int gcd(int a,int b){
	return b?gcd(b,a%b):a;
}

void slove(){
	int n;cin>>n;
	int x=(1+n)*n/2+n,y=n*n; 
	int d=gcd(x,y);
	x/=d,y/=d; 
	//二分找到第一个大于d的数
	int l=1,r=n+1;
	while(l<r){
		int mid=(l+r)/2;
		if(mid*y<=x*n) l=mid+1;
		else r=mid;
	}
	if(r==n+1){
		int p1=(1+n)*n/2,p2=n;
		int d1=gcd(p1,p2);
		cout<<p1/d1<<" "<<p2/d1<<endl; 
	} 
	else { 
		int p1=(l-1+1)*(l-1)/2,p2=n;
		int d1=gcd(p1,p2);
		p1/=d1,p2/=d1;
		//后面的期望都是x/y;
		x*=(n-l+1);
		d=gcd(x,y);
		x/=d,y/=d;
		int d2=gcd(p2,y);
		int lc=p2/d2*y;
		int n1=lc/p2*p1,n2=lc/y*x;
		int x=n1+n2,y=lc;
		int d3=gcd(x,y);
		cout<<x/d3<<" "<<y/d3<<endl;
	}
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T=1;
	cin>>T;
	while(T--) slove();
}