#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <bitset>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <cassert>
#include <random>
#include <chrono>
#include <ctime>
#include <cstdlib>
#define pii pair<int,int> 
#define mp make_pair
#define pb emplace_back
#define debug() cout<<"qwq"<<endl
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef unsigned long long ull;
const int DMAX = 100000 + 5;
const double INF = 1e9;
const int MOD = 998244353;
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
template<class T> inline void read(T &x){
    T f=1; x=0; char ch=getchar();
    while(ch<'0' || ch>'9'){
        if(ch=='-') f=-1; 
        ch=getchar();
    }
    while(ch<='9' && ch>='0'){ x=x*10+ch-'0';ch=getchar(); }
    x*=f;
}
int n;
ll t;
int main(){
    read(n);
    while(n--){
        read(t);
        ll x = (sqrt(2 * t));
        ll fup, fdow;
        for(ll p = x - 1; p <= x + 1; p ++){
            fup = p * p + 2 * t - p;
            fdow = 2 * p;
            ll gc = __gcd(fup, fdow);
            fup /= gc, fdow /= gc;
            if((p - 1) * fdow <= fup && fup <= fdow * p){
                printf("%lld %lld\n", fup, fdow);
                break;
            }
        }
    }
}