#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
using ld = long double;

struct pii {
    int first, second;
};  

pii add(pii a, pii b) {
    int x = a.first * b.second + a.second * b.first;
    int y = a.second * b.second;
    int d = __gcd(x, y);
    return {x / d, y / d};
}   

pii mul(pii a, int k) {
    int x = a.first * k;
    int y = a.second;
    int d = __gcd(x, y);
    return {x / d, y / d}; 
}

void solve()
{
    long long xx;cin >> xx;
     int t = xx;
    int delta = 1 + 8 * t;
    ld sq = sqrtl(delta);
    int x = ceill((1 + sq) / 2);
    // cout << (long long)(x * x - x - 2 * t) << endl;
    
    
    auto calc = [&](int x) -> pii {
        x = min(x, t + 1);
        int len = x - 1;
        int res = 0;
    
    res += (1 + len) * len / 2;
        pii ans = {res, t};
    // cout << len << endl;
    int d = __gcd(ans.first, ans.second);
    ans = {ans.first / d, ans.second / d};
    if(t - x + 1 > 0)
    {
        pii tmp = mul(add({t, x - 1}, {x, 2}), t - x + 1);
        // cout << tmp.first <<" " << tmp.second << endl;
        tmp = {tmp.first, tmp.second * t};
        int d = __gcd(tmp.first, tmp.second);
        tmp.first /= d;tmp.second /= d;
        // cout << ans.first <<" " << ans.second <<" " << tmp.first <<" " << tmp.second << endl;
        ans = add(ans, tmp);
    }
    return ans;
    };
    pii ans = calc(x);
    // pii ans1 = calc(x + 1);
    // if(ans1.first * ans.second < ans1.second * ans.first)
    // {
    //     ans = ans1;
    // }


    cout << (long long)ans.first <<" " << (long long)ans.second << endl;


}


signed main() 
{
    ios::sync_with_stdio(false);cin.tie(0);
    long long T;cin >> T;
    while(T--)
    solve();
}