Prime Pair Finder

Given an integer n, find two prime numbers p and q such that \(p + q = n\). If there is no such pair, output No pair found. When multiple valid pairs exist, output the first valid pair found by iterating from 2 up to \(\lfloor n/2 \rfloor\).

You need to process multiple datasets provided through standard input.

inputFormat

The first line contains an integer T, the number of test cases. Each of the following T lines contains a single integer n.

outputFormat

For each test case, output one line. If a valid prime pair \(p\) and \(q\) is found such that \(p + q = n\), print them in the format p q (separated by a single space). Otherwise, print No pair found.

4
10
34
85
97

3 7
3 31
2 83
No pair found