------
## 最终结论
```python
def find_divisors(n):
    divisors = set()
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            divisors.add(i)
            if i != n // i:
                divisors.add(n // i)
    return sorted(divisors)

def is_coprime(a, b):
    from math import gcd
    return gcd(a, b) == 1

def decrypt_message(n):
    divisors = find_divisors(n)
    if len(divisors) <= 1:
        return divisors, 0
    
    # Start with the smallest divisor and arrange them in increasing order
    order = sorted(divisors)
    
    # Check if the constructed circle is valid without additional moves
    moves = 0
    for i in range(len(order)):
        if is_coprime(order[i], order[(i+1) % len(order)]):
            moves += 1
    
    return order, moves

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    
    t = int(data[0])
    
    results = []
    
    index = 1
    for _ in range(t):
        n = int(data[index])
        index += 1
        
        order, moves = decrypt_message(n)
        
        results.append((order, moves))
    
    for order, moves in results:
        print(" ".join(map(str, order)))
        print(moves)

if __name__ == "__main__":
    main()
```