#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

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

void solve() {
    int n;
    cin >> n;
    if (n == 3) {
        cout << "2 1\n";
        return;
    }
    if (n <= 5) {
        cout << "-1\n";
        return;
    }
    if (!prime(n - 2)) {
        cout << "2 " << n - 2 << '\n';
        return;
    }
    if (!prime(n - 3)) {
        cout << "3 " << n - 3 << '\n';
        return;
    }
    assert(false);
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--)
        solve();
}