#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long

int T, n;

bool prime(int n)
{
    if(n<=1)
        return 0;
    for (int i = 2; i * i <= n; ++i)
    {
        if (n % i == 0)
            return 0;
    }
    return 1;
}

void solve()
{
    std::cin >> n;
    for (int i = 2; i <= n; ++i)
    {
        if (prime(i)==0 && prime(n - i)==1)
        {
            std::cout << n-i << " " << i << endl;
            return;
        }
    }
    std::cout << "-1" << endl;
    return;
}

signed main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);

    std::cin >> T;
    while (T--)
    {
        solve();
    }

    return 0;
}