Given q queries, each is an integer n, find all prime factors of n.
### Input
- The first line contains an integer q.
- The next q line, each line contains an integer n.
### Output
- Print q lines, ith line contains every prime factors of ith query in ascending order.
### Constraints
- 1≤q≤5×105.
- 2≤n≤106.
### Example
Input:
2924
Output:
323