An agent called Cypher is decrypting a message, that contains a composite number $n$. All divisors of $n$, which are greater than $1$, are placed in a circle. Cypher can choose the initial order of numbers in the circle.

In one move Cypher can choose two adjacent numbers in a circle and insert their least common multiple between them. He can do that move as many times as needed.

A message is decrypted, if every two adjacent numbers are not coprime. Note that for such constraints it's always possible to decrypt the message.

Find the minimal number of moves that Cypher should do to decrypt the message, and show the initial order of numbers in the circle for that.


-----Input-----

The first line contains an integer $t$ $(1 \le t \le 100)$ — the number of test cases. Next $t$ lines describe each test case.

In a single line of each test case description, there is a single composite number $n$ $(4 \le n \le 10^9)$ — the number from the message.

It's guaranteed that the total number of divisors of $n$ for all test cases does not exceed $2 \cdot 10^5$.


-----Output-----

For each test case in the first line output the initial order of divisors, which are greater than $1$, in the circle. In the second line output, the minimal number of moves needed to decrypt the message.

If there are different possible orders with a correct answer, print any of them.


-----Example-----
Input
3
6
4
30

Output
2 3 6 
1
2 4 
0
2 30 6 3 15 5 10 
0



-----Note-----

In the first test case $6$ has three divisors, which are greater than $1$: $2, 3, 6$. Regardless of the initial order, numbers $2$ and $3$ are adjacent, so it's needed to place their least common multiple between them. After that the circle becomes $2, 6, 3, 6$, and every two adjacent numbers are not coprime.

In the second test case $4$ has two divisors greater than $1$: $2, 4$, and they are not coprime, so any initial order is correct, and it's not needed to place any least common multiples.

In the third test case all divisors of $30$ greater than $1$ can be placed in some order so that there are no two adjacent numbers that are coprime.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'import sys\ninput=lambda:sys.stdin.readline().rstrip()\n\ndef gcd(a, b):\n  while b: a, b = b, a % b\n  return a\ndef isPrimeMR(n):\n  d = n - 1\n  d = d // (d & -d)\n  L = [2, 3, 61]\n  for a in L:\n    t = d\n    y = pow(a, t, n)\n    if y == 1: continue\n    while y != n - 1:\n      y = (y * y) % n\n      if y == 1 or t == n - 1: return 0\n      t <<= 1\n  return 1\ndef findFactorRho(n):\n  m = 1 << n.bit_length() // 8\n  for c in range(1, 99):\n    f = lambda x: (x * x + c) % n\n    y, r, q, g = 2, 1, 1, 1\n    while g == 1:\n      x = y\n      for i in range(r):\n        y = f(y)\n      k = 0\n      while k < r and g == 1:\n        ys = y\n        for i in range(min(m, r - k)):\n          y = f(y)\n          q = q * abs(x - y) % n\n        g = gcd(q, n)\n        k += m\n      r <<= 1\n    if g == n:\n      g = 1\n      while g == 1:\n        ys = f(ys)\n        g = gcd(abs(x - ys), n)\n    if g < n:\n      if isPrimeMR(g): return g\n      elif isPrimeMR(n // g): return n // g\n      return findFactorRho(g)\ndef primeFactor(n):\n  i = 2\n  ret = {}\n  rhoFlg = 0\n  while i*i <= n:\n    k = 0\n    while n % i == 0:\n      n //= i\n      k += 1\n    if k: ret[i] = k\n    i += 1 + i % 2\n    if i == 101 and n >= 2 ** 20:\n      while n > 1:\n        if isPrimeMR(n):\n          ret[n], n = 1, 1\n        else:\n          rhoFlg = 1\n          j = findFactorRho(n)\n          k = 0\n          while n % j == 0:\n            n //= j\n            k += 1\n          ret[j] = k\n\n  if n > 1: ret[n] = 1\n  if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}\n  return ret\n\nfor _ in range(int(input())):\n  n=int(input())\n  ret=primeFactor(n)\n  m=len(ret)\n  s=1\n  a=[]\n  for i in ret:\n    a.append(i)\n    s*=ret[i]+1\n  ans=[]\n  for i in range(m):\n    s//=ret[a[i]]+1\n    for j in range(1,ret[a[i]]+1):\n      for k in range(s):\n        x=a[i]**j\n        for l in range(i+1,m):\n          k,t=divmod(k,ret[a[l]]+1)\n          x*=a[l]**t\n        ans.append(x)\n  if gcd(ans[0],ans[-1])==1:\n    del ans[ans.index(ans[0]*ans[-1])]\n    ans.append(ans[0]*ans[-1])\n  anss=0\n  for i in range(len(ans)-1):\n    if gcd(ans[i],ans[i+1])==1:anss+=1\n  print(*ans)\n  print(anss)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14829