import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

N=100001
fact=[defaultdict(int) for x in range(N+1)]
X=[i**2+1 for i in range(N+1)]
for i in range(1,N+1):
    if X[i]!=1:
        p=X[i]
        for j in range(i,N+1,p):
            while X[j]%p==0:
                fact[j][p]+=1
                X[j]//=p
        for j in range((-i)%p,N+1,p):
            while X[j]%p==0:
                fact[j][p]+=1
                X[j]//=p
Q=int(readline())
for _ in range(Q):
    q=int(readline())
    ans_lst=[]
    for p,e in fact[q].items():
        ans_lst+=[p]*e
    ans_lst.sort()
    print(*ans_lst)