#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define LB(v, x) (int)(lower_bound(ALL(v), x) - (v).begin())
#define UQ(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define IO ios::sync_with_stdio(false), cin.tie(nullptr);
#define chmax(a, b) (a) = (a) < (b) ? (b) : (a)
#define chmin(a, b) (a) = (a) < (b) ? (a) : (b)
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

using LL = __int128_t;
const LL LL0 = 0;
const LL LL1 = 1;
const LL INFLL = LL1 << 120;

istream &operator>>(istream &is, LL &x) {
    int c = is.peek();
    while (c == ' ' || c == '\n') {
        is.get();
        c = is.peek();
    }
    bool neg = false;
    if (c == '-') {
        neg = true;
        is.get();
    }
    x = 0;
    while (isdigit(is.peek())) x = x * 10 + is.get() - '0';
    if (neg) x = -x;
    return is;
}

ostream &operator<<(ostream &os, LL x) {
    if (x < 0) {
        os << '-';
        x = -x;
    }
    if (x == 0) return os << '0';
    string s;
    while (x > 0) {
        s += x % 10 + '0';
        x /= 10;
    }
    reverse(s.begin(), s.end());
    return os << s;
}

int main() {
    IO;
    int T;
    cin >> T;

    while (T--) {
        LL N;
        cin >> N;

        LL X = 0, Y = 0;
        bool f = true;
        for (int i = 70; i >= 0; i--) {
            if (N >> i & 1) {
                if (f) {
                    X += 1ll << i;
                    f = false;
                } else {
                    Y += 1ll << i;
                    f = true;
                }
            }
        }

        cout << X << ' ' << Y << '\n';
        cerr << X * Y << ' ' << (X + Y) << ' ' << (X ^ Y) << '\n';
    }
}