#include<bits/stdc++.h>
using namespace std;
using ll = long long;

void solve() {
    ll n;
    cin >> n;
    if (__builtin_popcountll(n) == 0) {
        cout << "0 0\n";
        return;
    }
    if (__builtin_popcountll(n) == 1) {
        ll msb = (1ll << (63 - __builtin_clzll(n)));
        if (msb == 1) cout << "0 0\n";
        else cout << (msb >> 1) << ' ' << (msb >> 1) - 1 << '\n';
        return;
    }
    ll msb = (1ll << (63 - __builtin_clzll(n)));
    ll nsb = (1ll << (63 - __builtin_clzll(n ^ msb)));
    if ((nsb << 2) >= msb) cout << msb << ' ' << n - msb << '\n';
    else cout << (msb >> 1) << ' ' << (msb >> 1) - 1 << '\n';
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int q;
    cin >> q;
    while (q--) {
        solve();
    }
    return 0;
}