#include<iostream>
#include<set>
#include<map>
#include<vector>
#include<algorithm>
#include<bitset>
#include<math.h>
#include<string>
#include<string.h>
//#include<>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
ll gcd(ll a, ll b) {
	if (b == 0) return a;
	else return gcd(b, a % b);
}
void fio()
{
	ios::sync_with_stdio();
	cin.tie(0);
	cout.tie(0);
}
int main()
{
	fio();
	ll t;
	cin >> t;
	while (t--)
	{
		ll n;
		cin >> n;
		ll k;
		ll l = 1, r = n;
		while (l < r)
		{
			ll mid = (l + r) >> 1;
			if ((mid * mid - mid) / 2 < n)
			{
				l = mid + 1;
			}
			else if ((mid * mid + mid) / 2 >= n)
			{
				r = mid;
			}
		}
		k = r;
		//cout << k << endl;
		ll x = k * (k + 1) + 2 * (n - k);
		ll y = k * 2;
		ll u = gcd(x, y);
		cout << x / u << " " << y / u << endl;
	}
}