#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull long long
#define PII  pair<int ,int>
const int INF = -1145141919810;
const int mod = 1e9 + 7;
const int N = 1e7;
int a[N];
int sum[N];
int fa[N];
int ka[N];
vector<int>pr;
bool vis[N];
void er(int n) {
	int cnt = 0;
	memset(vis, 0, sizeof(vis));
	for (int i = 2; i <= n; i++) {
		if (!vis[i])pr.push_back(i);
		for (int j = 0; j < pr.size(); j++) {
			if (i * pr[j] > n)break;
			vis[i * pr[j]] = 1;
			if (i * pr[j] == 0)break;
		}
	}
}
int is_p(int x) {
	if (x == 1)return 1;
	for (int i = 0; i < pr.size(); i++) {
		if (x == pr[i])return 1;
		if (x % pr[i] == 0)return 0;
		if (pr[i] > x)break;
	}
	return 1;
}


void solve() {
	int n;
	cin >> n;
	/*for (int i = 0; i < pr.size(); i++) {
		int a = pr[i], b = n - a;
		if (is_p(b) == 0) {
			cout << a << " " << b << endl;
			return ;
		}
	}*/
	if (n % 2 == 0) {
		int a = 2, b = n - a;
		if (b == 1 || b == 2)cout << -1 << endl;
		else cout << a << " " << b << endl;
	}
	else {
		int a = 3, b = n - a;
		if (b == 1 || b == 2)cout << -1 << endl;
		else cout << a << " " << b << endl;
	}
	//cout << -1 << endl;	
}
//&&(((sum[n]+k)%mid==0)||(sum[n]/mid!=(sum[n]+k)/mid)||(mid-(sum[n]%mid)>=k))
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t=1;
	cin >> t;
	//t = 1;
	er(9e6);
	while (t--)solve();
	
}
//int n;
//cin >> n;
//for (int i = 1; i <= n; i++) {
//	cin >> a[i];
//}
//int maxx = 0, minn = INF;
//int sum = 0;
//for (int i = n; i <= 1; i++) {
//	sum += minn;
//	if (top == 0) {
//		minn = a[i];
//		st[top++] = a[i];
//	}
//	else {
//		if (a[i] > top && a[i] > minn)
//	}
//}
//cout << maxx - minn << endl;
//7 2 1 4 5 1 3 3
//4 1000 1000 1000 1000
//0