import math

def count_trailing_zeros_in_base(n, base):
    count = 0
    while n % base == 0:
        n //= base
        count += 1
    return count

def find_optimal_bases(n):
    max_zeros = 0
    best_bases = []
    
    for i in range(1, int(math.sqrt(n)) + 1):
        if n % i == 0:
            for base in [i, n // i]:
                if base > 1: 
                    zeros = count_trailing_zeros_in_base(n, base)
                    
                    if zeros > max_zeros:
                        max_zeros = zeros
                        best_bases = [base]
                    elif zeros == max_zeros:
                        best_bases.append(base)
    
    best_bases.sort()
    return max_zeros, best_bases

results = []

for _ in range(int(input())):
    n = int(input("Enter n: "))
    max_zeros, bases = find_optimal_bases(n)
    results.append((max_zeros, len(bases), bases))

for result in results:
    max_zeros, m, bases = result
    print(max_zeros, m)
    print(" ".join(map(str, bases)))