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

int n, T;
inline int gcd(int a, int b) { return !b?a:gcd(b,a%b); }
inline int lcm(int a, int b) { return 1ll*a*b/gcd(a,b); }
struct frac { 
    int so, ma;
    frac(int x = 0, int y = 1) { so = x; ma = y; }
    inline void hua(void) {
        int gg = gcd(so, ma);
        if (!gg) return;
        so /= gg, ma /= gg;
    }
    friend frac operator +(frac a, frac b){
        int  mother = lcm(a.ma, b.ma);
        frac c = frac(b.so * a.ma + a.so * b.ma, mother);
        return c.hua(), c;
    }
    friend frac operator +(frac a, int b) { return a+frac(b, 1); }
    friend frac operator -(frac a, frac b) {
        int  mother = lcm(a.ma, b.ma);
        frac c      = frac(a.so * b.ma - b.so * a.ma, mother);
        return c.hua(), c;
    }
    friend frac operator *(frac a, frac b) {
        frac c = frac(a.so * b.so, a.ma * b.ma);
        return c.hua(), c;
    }
    friend frac operator /(frac a, frac b) { b.so ^= b.ma ^= b.so ^= b.ma; return a * b; }
    friend frac operator /(frac a, int b) { return a / frac(b, 1); }
    friend frac operator /(int a, frac b) { return frac(a, 1) / b; }
	friend bool operator <(frac a, frac b) { return 1LL * a.so * b.ma < 1LL * b.so * a.ma; }
    friend bool operator >(frac a, frac b) { return 1LL * a.so * b.ma > 1LL * b.so * a.ma; }
    friend bool operator <=(frac a, frac b) { return 1LL * a.so * b.ma <= 1LL * b.so * a.ma; }
    friend bool operator >=(frac a, frac b) { return 1LL * a.so * b.ma >= 1LL * b.so * a.ma; }
    friend bool operator ==(frac a, frac b) { return 1LL * a.so * b.ma == 1LL * b.so * a.ma; }
};
void Work() {
	cin >> n;
	frac k = frac(sqrt(2 * n), 1);
	frac minn = (k + 2 * n / k + 1) / 2 - 1;
	frac tmp = (k + 1 + 2 * n / (k + 1) + 1) / 2 - 1;
//	printf("minn = %lld/%lld, tmp = %lld/%lld\n", minn.so, minn.ma, tmp.so, tmp.ma); 
	if (minn > tmp) minn = tmp;
	if (minn > frac(n, 1)) minn = frac(n, 1);
	printf("%lld %lld\n", minn.so, minn.ma);
}
signed main() {
	cin >> T;
	while (T --) Work();
	return 0;
}