#include <bits/stdc++.h>
#define x first
#define y second
#define int long long
#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<long ,long > pii;
typedef pair<char,int > pci;

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


int p[N];


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

    int x = 0;

    x+=a*(t/b);

    x+=c*(t/d);

    return {x,t};

}


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

    int x = sqrt(2*n);

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

    double tmp = ans.x/ans.y;


    for(int i=x;i>=(max(1ll,x-100));i--)
    {
        if(1.0*(i-1)/2+n/i<tmp)
        {
            ans=tf((i-1),2,n,i);
            tmp=1.0*(i-1)/2+n/i;
        }
    }

    for(int i=x;i<=(min(n,x+100));i++)
    {
        if(1.0*(i-1)/2+n/i<tmp)
        {
            ans=tf((i-1),2,n,i);
            tmp=1.0*(i-1)/2+n/i;
        }
    }


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

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

    cout<<ans.x<<" "<<ans.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;
}