#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pii;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define x first
#define y second
const double PI=acos(-1.0);
const int N=1e6+5;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
void solve(){
    int t;
    cin >> t;
    int c = sqrt(2 * t);
    
    int fz1 = (c + 1) * c + 2 * t;
    int fm1 = 2 * c;

    c++;
    int fz2 = (c + 1) * c + 2 * t;
    int fm2 = 2 * c;
    
    if (1.0 * fz1 / fm1 < 1.0 * fz2 / fm2){
        fz1 -= fm1;
        int g = gcd(fz1,fm1);
        cout << fz1 / g << " " << fm1 / g << endl;
    }else{
        fz2 -= fm2;
        int g = gcd(fz2,fm2);
        cout << fz2 / g << " " << fm2 / g << endl;
    }

}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int t;cin >> t;while(t--)
    solve();
    return 0;
}