#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
 
LL pri[16] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};
 
LL ans,n,MAXY;
    //求n以内因子最多的数,多个答案输出小的
void dfs(LL Y,LL dep,LL num,LL limit){
        //因子数 深度 当前的数
    if(dep==16)return;
    //if(Y>=n)return;
    if(Y>MAXY)MAXY=Y,ans=num;
    if(Y==MAXY)ans=min(ans,num);
 
    for(int i=1;i<=limit;i++){
        //因为后面的次数不会超过前面,所以这里添加上限就是一个极大的剪枝
        if(n/pri[dep]<num)break;//保证不超过n
        dfs(Y*(i+1),dep+1,num*=pri[dep],i);
    }
}
 
int main(){
    int t;cin>>t;
    while(t--){
        scanf("%lld",&n);
        ans=1e18;
        MAXY=0;
        dfs(1,0,1,60);
        printf("%lld %lld\n",ans,MAXY);
    }
}
 
 

IAojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwp0eXBlZGVmIGxvbmcgbG9uZyBMTDsKIApMTCBwcmlbMTZdID0gezIsMyw1LDcsMTEsMTMsMTcsMTksMjMsMjksMzEsMzcsNDEsNDMsNDcsNTN9OwogCkxMIGFucyxuLE1BWFk7CiAgICAvL+axgm7ku6XlhoXlm6DlrZDmnIDlpJrnmoTmlbAs5aSa5Liq562U5qGI6L6T5Ye65bCP55qECnZvaWQgZGZzKExMIFksTEwgZGVwLExMIG51bSxMTCBsaW1pdCl7CiAgICAgICAgLy/lm6DlrZDmlbAg5rex5bqmIOW9k+WJjeeahOaVsAogICAgaWYoZGVwPT0xNilyZXR1cm47CiAgICAvL2lmKFk+PW4pcmV0dXJuOwogICAgaWYoWT5NQVhZKU1BWFk9WSxhbnM9bnVtOwogICAgaWYoWT09TUFYWSlhbnM9bWluKGFucyxudW0pOwogCiAgICBmb3IoaW50IGk9MTtpPD1saW1pdDtpKyspewogICAgICAgIC8v5Zug5Li65ZCO6Z2i55qE5qyh5pWw5LiN5Lya6LaF6L+H5YmN6Z2iLOaJgOS7pei/memHjOa3u+WKoOS4iumZkOWwseaYr+S4gOS4quaegeWkp+eahOWJquaenQogICAgICAgIGlmKG4vcHJpW2RlcF08bnVtKWJyZWFrOy8v5L+d6K+B5LiN6LaF6L+HbgogICAgICAgIGRmcyhZKihpKzEpLGRlcCsxLG51bSo9cHJpW2RlcF0saSk7CiAgICB9Cn0KIAppbnQgbWFpbigpewogICAgaW50IHQ7Y2luPj50OwogICAgd2hpbGUodC0tKXsKICAgICAgICBzY2FuZigiJWxsZCIsJm4pOwogICAgICAgIGFucz0xZTE4OwogICAgICAgIE1BWFk9MDsKICAgICAgICBkZnMoMSwwLDEsNjApOwogICAgICAgIHByaW50ZigiJWxsZCAlbGxkXG4iLGFucyxNQVhZKTsKICAgIH0KfQogCiA=

MQoxMDAwMDAw

1
1000000