def prime_factors(n):
    i = 2
    while i < n:
        if n % i == 0:
            return [i] + prime_factors(n // i)
        i = i + 1
    return [n]


import math

i=nan
while math.isnan(i) :
   i =int(input())

print(prime_factors(i))