#include<bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define i128 __int128
typedef pair<int,int>PII;
typedef pair<int,char>PIC;
typedef pair<int,PII>PIII;

const int N=300010,mod=1000000007;

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}
int qmi(int x,int k,int q ){
    int cnt=x;
    int res=1;
    while(k){
        if(k&1)res=res*cnt%q;
        k>>=1;
        cnt=cnt*cnt%q;
    }
    return res;
}
int fact[N], infact[N];

void init_C(){
    fact[0]=infact[0]=1;
    for (int i = 1; i < N; i++){
        fact[i]=fact[i-1]*i%mod;
        infact[i]=infact[i-1]*qmi(i,mod-2,mod)%mod;
    }
}

int get_C(int a, int b){
    int res = (fact[a] * infact[b] % mod * infact[a - b] % mod) % mod;
    return res;
}


void solve(){
    int n;
    cin >> n;
    int l = sqrt(2 * n);
    int r = ceil(sqrt(2 * n));
    if(n==1){
        cout << "1 1\n";
        return;
    }

    double r1 = (1.0 + l) * l / 2.0 + 1.0 * (n - l) * (l+1);
    double r2 = (1.0 + r) * r / 2.0 + 1.0 * (n - r) * (r+1);
    
    if(r1<r2){
        int u = 0, d = 0;
        u = (1 + l) * l + 2 * (n - l) * (l + 1);
        d = 2 * n;
        int g = gcd(u, d);
        u /= g;
        d /= g;
        cout << u << ' ' << d << '\n';
    }
    else {
        int u = 0, d = 0;
        u = (1 + r) * r + 2 * (n - r) * (r + 1);
        d = 2 * n;
        int g = gcd(u, d);
        u /= g;
        d /= g;
        cout << u << ' ' << d << '\n';
    }
}


signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    

    int t;cin>>t;
    while(t--)
        solve();
    
    return 0;
}