PRIME FACTORIZATION
-------------------

Each integer m > 1 has a unique factorization into prime numbers.
In this problem you must output this factorization.

INPUT
-----
The first line of input will be a positive integer n.
Each of the following n lines will contain a single integer m
with 1 < m < 10^9.

OUTPUT
------
For each input integer m, output a list of prime numbers which,
when multiplied together gives m.  The prime numbers should be listed
in non-decreasing order.

SAMPLE INPUT
------------
3
140
16
29

SAMPLE OUTPUT
-------------
2 2 5 7
2 2 2 2
29