For each even integer \(n\), find the smallest prime \(p\) for which \(q=n-p\) is a different prime.

Input

The first line contains \(T\). Each of the next \(T\) lines contains an even integer \(n\).

The input satisfies:

• \(1 \le T \le 100\)
• \(6 \le n \le 10^7\)
• \(n is even and a valid pair exists.\)

Output

For each query, print \(p\) and \(q\) separated by one space.

Example

Input

1
8

Output

3 5