Description

Spring is coming, T_T.
All you know Goldbach conjecture.That is to say, Every even integer greater than 2 can be expressed as the sum of two primes. Today, skywind present a new conjecture: every even integer can be expressed as the difference of two primes.
To validate this conjecture, you are asked to write a program.

Format

Input

The first line of input is a number $n$ identified the count of test cases($n<10^4$).
There is a even number $x$ at the next $n$ lines.
The absolute value of $x$ is not greater than $10^6$.

Output

For each number $x$ tested, outputs two primes $a$ and $b$ at one line separated with one space where $a-b=x$.
If more than one group can meet it, output the minimum group（of course refers $b$）.
If no primes can satisfy it, output '$FAIL$'.

Samples

3
6
10
20

11 5
13 3
23 3