#include <bits/stdc++.h>
#define int long long
using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;
using namespace std;
void solve() {
    int n;
    std::cin >> n;

    std::vector<int> t(n);
    for (int i = 0; i < n; i++) {
        std::cin >> t[i];
        int ansx = t[i] + 1, ansy = 2;
        int g = std::gcd(ansx, ansy);
        ansx /= g, ansy /= g;
        int f=max((int)(sqrt(t[i]/2)),3ll);
        /*
        for(int j= 0;j<20;j++)
        {
            int now=no+j;
            if(now<2||now>t[i])
                break;
            int _=t[i]/now;
            int nx=(t[i]-_)*2+(_+1)*(_);
            int ny=_*2;
            int ng = std::gcd(nx, ny);
            nx/=ng,ny/=ng;
            if(ansx * ny > nx * ansy)
            {
                ansx=nx;
                ansy=ny;
                f=now;
            }
        }
        */
        for(int j=t[i]/(f+1);j<t[i]/(f-1);j++)
        {
            int nx=(t[i]-j)*2+(j+1)*(j);
            int ny=j*2;
            int ng = std::gcd(nx, ny);
            nx/=ng,ny/=ng;
            if(ansx * ny > nx * ansy)
            {
                ansx=nx;
                ansy=ny;
            }
        }
        std::cout << ansx <<" "<< ansy << "\n";
    }
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    //std::cin >> t;
    t = 1;

    while (t--) {
        solve();
    }
}