python解法，20ms

import math
def is_prime_number(num):
    if num == 1:
        return False
    for i in range(2, int(math.sqrt(num)) + 1):
        if num % i == 0:
            return False
        continue
    return True

while True:
    try:
        lt = []
        number = int(input())
        if is_prime_number(number):
            lt.append(number)
        else:
            for i in range(2, int(number / 2) + 1):
                while number % i == 0:
                    lt.append(i)
                    number = number // i
                if is_prime_number(number):
                    lt.append(number)
                    break
        for i in sorted(lt):
            print(i, end = ' ')

    except:
        break