Expressing an Integer as the Sum of Two Primes

Given an integer n, determine whether it can be expressed as the sum of two prime numbers, i.e., find prime numbers p and q such that $$p+q=n$$. If such a pair exists, output one such pair in the format "p q"; otherwise, output -1.

You need to process each test case independently. This problem is inspired by Goldbach's conjecture for even numbers, though here it applies to any integer input.

inputFormat

The input is read from stdin. The first line contains an integer T representing the number of test cases. Each of the following T lines contains a single integer n.

outputFormat

For each test case, print the pair of primes (separated by a space) if such a pair exists; otherwise, print -1. Each answer should be printed on its own line to stdout.

1
10

3 7