Goldbach Conjecture Pair Finder

The Goldbach Conjecture states that every even integer \( n \geq 4 \) can be expressed as the sum of two prime numbers \( p \) and \( q \) (i.e. \( n = p + q \)). Given an even number, your task is to find one such prime pair.

inputFormat

The first line of input contains an integer \( T \) representing the number of test cases. Each of the following \( T \) lines contains one even integer \( n \) (with \( n \geq 4 \)).

outputFormat

For each test case, output one line containing two prime numbers \( p \) and \( q \) separated by a space such that \( p + q = n \). If there are multiple valid pairs, output any one of them.

1
10

3 7