题意:
解法:
n<=5时无解,
否则(2,n-2)和(3,n-3)中一定有一个满足.
code:
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxm=3e3+5;
void solve(){
int n;cin>>n;
if(n<=5){
cout<<-1<<endl;
}else{
if(n%2==0){
cout<<2<<' '<<n-2<<endl;
}else{
cout<<3<<' '<<n-3<<endl;
}
}
}
signed main(){
ios::sync_with_stdio(0);
int T;cin>>T;
while(T--){
solve();
}
return 0;
}