#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************

// 5
// 3
// 5
// 2
// 999997
// 999999



int count(int n, int mid){

	int ct = 0;
	for(int i=1; i<=n; i++){
		ct += min( mid/i , n );
	}
	return ct;
	
}



int consistency1(int n){
    if(n==1) return 1;
    int s = 1, e = n*n;
    int ans = LINF;
    while(s<=e){
        int mid = s + (e-s)/2;
        if(count(n, mid) >= (n*n+1)/2 ){
            ans = min(ans, mid);
            e = mid-1;
        }
        else s = mid+1;
    }
 
    return ans;
 
}


int consistency2(int n){
    int s = 1;
    int e = n*n;
    int total = n*n;
    
    while(s<e){
    	int mid = s + (e-s)/2;
    	if(count(n, mid) >= (total+1)/2){
    		e = mid;
    	}
    	else s = mid+1;
    }
    
    return e;

}

void solve() {
    
    int n;
    cin>>n;
    
    cout << consistency1(n) << " " << consistency2(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}