import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

m = 100002
dp = [i**2+1 for i in range(m)]
ans = [[] for _ in range(m)]

for i in range(1, m):
    if dp[i] == 1: continue
    p = dp[i]
    for j in range(i, m, p):
        while dp[j]%p == 0:
            dp[j] //= p
            ans[j].append(p)
    for j in range(-i+p, m, p):
        while dp[j]%p == 0:
            dp[j] //= p
            ans[j].append(p)

for _ in range(II()):
    print(*sorted(ans[II()]))