#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
#define int long long
const int INF = 4e18+5;
#define F(i,l,r) for(int i=l;i<=r;i++)
#define R(i,l,r) for(int i=r;i>=l;i--)
#define vv vector
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
//const int mod = 998244353; 
const int mod = 1e9+7; 
const int M = 1e7+5;
int b[N],dp[N],vis[N],pri[N],a[N],ans1[N],ans2[N],c[N]; 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int n,m,k,ans,x,y,n0,n2,m0,m2,op,op1,op2;
string s;
map<int,int>mp;
map<int,int>mmap;
//char mp[1005][1005];
//vector<int>v1[N],v2[N];
int lowbit(int x) {
	return x&-x;
}
char xx[N];
bool temp;
int kuai(int x,int y){
	int sum=1;
	x%=mod;
	while(y){
		if(y%2){
			y--;
			sum*=x;
			sum%=mod;
		  }
	  x*=x;
	  y/=2;
	  x%=mod;
	}
	return sum;
}
struct node{
	int sum,l,r,add;
}tree[N];
bool check(int x){
	int x0,y0,x1=(1+n)*n,y1=2;
	y=x-1;
	x0=(1+x)*x/2+(n-x);
	y0=x;
	if(y>0){
		x1=(1+y)*y/2+(n-y);
		y1=y;
	}
	//cout<<x0<<" "<<y0<<" "<<x1<<" "<<y1<<endl;
	if(x0*y1<=x1*y0) {
		op1=x0,op2=y0;
		return true;
	}
	return false;
}
void solve()
{
	cin>>n;
	int l=1,r=n+1;
	op1=(1+n)*n/2; op2=n;
    while(l<r){
    	int mid=l+r>>1;
    	//cout<<mid<<"**"<<endl;
    	if(check(mid)) l=mid+1;
    	else r=mid;
	}
	op=__gcd(op1,op2);
	cout<<op1/op<<" "<<op2/op<<endl;
}
signed main() 
{
	ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0); // cin.tie(nullptr);
    int T = 1;                                                                                                                                                                                                                                                                    
    cin >> T;
    for (int i = 1; i <= T; i++)
    {
        solve();
    }
    return 0;
}