#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <numeric>
using namespace std;
void speed()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
}

int gcd(int a, int b)
{
    if( b == 0 )
        return a;
    return gcd(b, a % b);
}
int main()
{
    speed();
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        int x1 = floor(sqrt(2*n));
        int x2 = ceil(sqrt(2*n));
        int a1 = x1*x1 + 2*n - x1;
        int b1 = 2 * x1;
        int g = gcd(a1, b1);
        a1 /= g, b1 /= g;

        int a2 = x2*x2 + 2 *n - x2;
        int b2 = 2 * x2;
        g = gcd(a2, b2);
        a2 /= g, b2 /= g;

        if( a1 * b2 < a2 * b1)
        {
            cout << a1<<" "<<b1<<endl;
        }
        else
        {
            cout << a2<<" "<<b2<<endl;
        }
    }





    return 0;
}