#include<map>

#include<queue>

#include<stack>

#include<cmath>

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#define INF 1000000001

#define ll unsigned long long

#define lson l,m,rt<<1

#define rson m+1,r,rt<<1|1

using namespace std;

const int MAXN = ;

int prime[]={,,,,,,,,,,,,,,,,,,,};

ll n;

ll ans,ans_cnt;

void getarcprime(ll cur,ll cnt,int limit,int k)

{

    if(cur > n)return;

    if(cnt > ans_cnt){

        ans_cnt = cnt;

        ans = cur;

    }

    else if(cnt == ans_cnt && cur < ans){

        ans = cur;

    }

    for(int i = ; i <= limit; i++){

        if(n / prime[k] < cur){

            return;

        }

        getarcprime(cur*prime[k],cnt*(i+),i,k+);

        cur = cur*prime[k];

    }

}

int main()

{

    int t;

    cin >>t;

    while(t--){

        cin >>n;

        ans = ;

        ans_cnt = ;

        getarcprime(,,,);

        cout<<ans<<" "<<ans_cnt<<endl;

    }

    return ;

}