Prime Pair Sum

Given an integer N, find two prime numbers whose sum equals N. If such a pair exists, output the two prime numbers separated by a space. Otherwise, output "NO". Recall that a prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. In mathematical notation, a number P is prime if P > 1 and for every integer k with 2 \le k \le \sqrt{P}, P \mod k \neq 0.

inputFormat

The input is read from standard input. The first line contains an integer T representing the number of test cases. Then follow T lines, each containing an integer N.

outputFormat

For each test case, output a single line. If there exist two prime numbers whose sum equals N, output the first pair found in the format "p1 p2" (where p1 and p2 are prime numbers). Otherwise, output "NO".

3
10
16
27

3 7
3 13
NO