MI6

MI6 confirms a spy's identity with a spy identification code (SIC). James Bond's SIC is $7$.

A group of spies is written as a single status code, the product of the SICs of every spy in the group. No two spies share an SIC, and no spy appears twice in the same group.

So that no status code goes to waste, MI6 assigns SICs to match groups one to one with the integers of at least $2$. For every integer $c \ge 2$ exactly one group has status code $c$, and two different groups never carry the same status code. That single condition fixes the set of numbers used as SICs.

Given a status code, print the SICs of every spy in the group whose status code is that value.

The first line contains the number of test cases, which is at most $100$.

Each test case is one line holding a status code $c$ ($2 \le c \le 10^9$).

For each test case, print on one line the SICs of the spies in the group whose status code is $c$, in increasing order. Print a single space between consecutive SICs.