/*
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define sqrt(a) sqrtl(a)
#define abs(a) llabs(a)
#define pow(a) powl(a)
typedef  pair<int,int> pi ;
#define if1(x) for(int i =1 ;i<=x;i++)
#define if0(x) for(int i = 0;i<x;i++)
#define jf0(x) for(int j = 0;j<x;j++)
#define jf1(x) for(int j = 1;j<=x;j++)
#define pb push_back
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int N = 2e5+10;
    int m,n;
pi gg(int x){
    int p =x;
    int sum = p*(p+1)/2;
    int fm = p;
    int fz = sum+n-p;
    int gc = __gcd(fz,fm);
    fm /= gc;
    fz /= gc;
    return {fz,fm};
}
void solve(){
    cin>>n;
    if(n == 1){
        cout<<1<<" "<<1<<endl;return;
    }
    int x = sqrt(2*x);
    vector<pi> ns;
    pi ans = {inf,1};
    for(int i = -10;i<=10;i++){
        if( i+x <=0)continue;
        if(i+x>n)break;
        pi te = gg(i+x);
        if(ans.first * te.second >te.first *ans.second) ans = te;
    }
    
    cout<<ans.first<<" "<<ans.second<<endl;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr); 
    int t=1;
    cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}
/*


*/