#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > piii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

void cal(ll x, __int128& a, __int128& b) {
    for (int i = 62; i >= 0; i--)
        if (x >> i & 1) {
            b = x - (1ll << i), a = x - b;
            return;
        }
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        ll n;
        scanf("%lld", &n);
        ll t = 1;
        while (t * 2 <= n) t <<= 1;
        t -= 1;
        __int128 v1 = 0, v2 = 0, v3 = 0, v4 = 0;
        cal(n, v1, v2);
        cal(t, v3, v4);
        ll a, b;
        if (v1 * v2 > v3 * v4) {
            a = v1, b = v2;
        } else a = v3, b = v4;
        printf("%lld %lld\n", a, b);
    }
    return 0;
}