#include <bits/stdc++.h>
#define x first
#define y second
#define int __int128
#define sqrt sqrtl
#define all(x) (x).begin(),(x).end()
#define mem(x,y,l,r) for(int _=l;_<=r;_++) x[_]=y;
#define jxjxjx

#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define debug(...) (void)42
#endif

using namespace std;
typedef pair<int,int> pii;
typedef pair<char,int > pci;

const int  N =2e6+10,mod = 998244353;
const long double eps=1e-12;

int p[N];

using i64 = int64_t;
using i128 = __int128;

std::istream &operator>>(std::istream &is, i128 &n) {
	std::string s;
	is >> s;
	n = 0;
	for (int i = (s[0] == '-'); i < s.size(); i += 1) {
		n = n * 10 + s[i] - '0';
	}
	if (s[0] == '-') {
		n *= -1;
	}
	return is;
}

std::ostream &operator<<(std::ostream &os, i128 n) {
	std::string s;
	if (n == 0) {
		return os << 0;
	}
	bool sign = false;
	if (n < 0) {
		sign = true;
		n = -n;
	}
	while (n > 0) {
		s += '0' + n % 10;
		n /= 10;
	}
	if (sign) {
		s += '-';
	}
	std::reverse(s.begin(), s.end());
	return os << s;
}


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


pii tf(int a,int b,int c,int d)
{
    int t =b*d;

    //cout<<t<<"\n";

    int x = 0;

    //cout<<a*(t/d)<<"\n";

    x+=a*d;

    //cout<<x<<"\n";

    //cout<<c*(t/b)<<"\n";

    x+=c*b;



    //cout<<t<<"\n";

    return {x,t};

}


void solve()
{
    int n;
    cin>>n;

    int x = sqrt(2*n);

    //pii ans = tf((x-1),2,n,x);

    long double tmp = 1.L*(x-1)/2+1.L*n/x;

    int ans = x;

    //cout<<tmp<<" "<<1.L*1755824328/41903<<"\n";


    for(int i=x;i>=(max((int)1,x-10));i--)
    {
        long double t = 1.L*(i-1)/2+1.L*n/i;
        if(tmp-t>eps)
        {
            ans=i;
            tmp=t;
        }
    }

    for(int i=x;i<=(min((int)n,x+10));i++)
    {
        long double t = 1.L*(i-1)/2+1.L*n/i;
        if(tmp-t>eps)
        {
            ans=i;
            tmp=t;
        }
    }



    /*int t = gcd(ans.x,ans.y);

    ans.x/=t;
    ans.y/=t;


    cout<<ans.x<<" "<<ans.y<<"\n";*/

    //cout<<ans<<"\n";

    pii res=tf(ans-1,2,n,ans);

    int t = gcd(res.x,res.y);

    res.x/=t;
    res.y/=t;

    //cout<<tmp<<" "<<1.L*1755824328/41903<<"\n";

    cout<<res.x<<" "<<res.y<<"\n";

}



/*
2 2 1 1 2 1
*/


signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(10);
    int  t=1;
    cin>>t;
    while(t--) solve();
    return 0;
}