#include<bits/stdc++.h>
using namespace std;
#define int long long
void op()
{
    int n;
    cin>>n;
    vector<int>prime;
    vector<bool>is(n+1,1);
    for(int i=2;i<=n/2;i++)
    {
        if(is[i])
            {
                prime.push_back(i);
            }
        for(int j=0;j<prime.size()and i*prime[j]<=n;j++)
        {
            is[i*prime[j]]=0;
            if(i%prime[j]==0)break;
        }
    }
    for(int i=0;i<prime.size();i++)
    {
        if(is[n-prime[i]])continue;
        cout<<prime[i]<<' '<<n-prime[i]<<endl;
        return;
    }
    cout<<-1<<endl;
}
signed main(void)
{
    int t;
    cin>>t;
    while(t--)
    op();
    return 0;
}