Sum of Pairs
------------
Given a number n between 1 and 12, find all the pairs of numbers 
between 1 and 12 that when summed produces n.  For instance, given 
the number 5, two possible pairs of numbers are 1,4 and 2,3.  Note 
that the two numbers in a pair must be different.  That is, 3,3
is not a legal pair.

To make the problem more challenging, the pairs must be presented
in lexicographic order.  That is, two pairs of numbers are compared 
by their lowest number.  For instance, 1,5 would come before 2,4 when
sorted in lexicographic order.

Input
-----
The first line in the test data contains the number of test cases
(<= 5,000,000). After that, each line contains one test case: the 
number n.

Output
------
For each test case, you are to output in lexicographic order the 
different pais of numbers between 1 and 12 that when summed produce
n. If there are no such numbers, don't print anything.

Sample input
------------
4
2
3
4
5

Sample output
-------------

1 2
1 3
1 4, 2 3