#pragma GCC optimize ("O3,inline,omit-frame-pointer,no-asynchronous-unwind-tables,fast-math")
#include <bits/stdc++.h>
#include <unordered_map>
#include <stdlib.h>
using namespace std;
#define rep(i, a, n) for(ll i = a; i < n; i++)
#define rrep(i, a, n) for(ll i = a; i >= n; i--)
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1LL<<60;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
 


int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll t; cin >> t;
    while(t--){
        ll n; cin >> n;
        ll x = 0, y = 0;
        ll flg = 0;
        ll flg2 = 0;
        rrep(i,60,0){
            if((n>>i)&1){
                if(flg) y += 1LL << i;
                else{
                    x += 1LL << i;
                    flg = true;
                }
            }else{
                if(flg){
                    x += 1LL << i;
                    y += 1LL << i;
                }
            }
        }
        cout << x << " " << y << endl;
    }
    return 0;
}