#include // #include // #include using namespace std; // using namespace atcoder; // using bint = boost::multiprecision::cpp_int; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair; using pll = pair; using vi = vector; using vvi = vector; using vvvi = vector; using ve = vector>; using vb = vector; using vvb = vector; #define rep(i,s,n) for(ll i = (ll)s;i < (ll)n;i++) #define rrep(i,l,r) for(ll i = r-1;i >= l;i--) #define ALL(x) (x).begin(),(x).end() #define sz(c) ((ll)(c).size()) #define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin()) #define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin()) // #define MOD 1000000007 #define MOD 998244353 templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,vector&v){for(int i = 0;i < v.size();i++)os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.first>>p.second;return is;} template inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;} template inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;} ld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));} void solve(){ ll n;cin >> n; if(n == 0){ cout << "0 0" << "\n"; return ; } __int128_t res = 0,mx = 0; pll ans = {0,0}; rep(i,0,62)if(n >> i & 1)mx = i; { __int128_t k = 1ll << mx,kk = n-(1ll << mx); if(chmax(res,k*kk)){ ans = {k,kk}; } } { __int128_t k = (1ll << (mx-1)),kk = k-1; if(chmax(res,k*kk)){ ans = {k,kk}; } } cout << ans << "\n"; } int main(){ ios_base::sync_with_stdio(0), cin.tie(0); int T;cin >> T; while(T--)solve(); return 0; }