题解 | #质数因子#

import sys

integer = int(input())

# A function to print all prime factors of
# a given number n

def primeFactors(n):
	
	elements=[]

	# Print the number of two's that divide n
	while n % 2 == 0:
		elements.append(2)
		n /= 2
		
	# n must be odd at this point
	# so a skip of 2 ( i = i + 2) can be used
	for i in range(3,int(n**0.5)+1,2):
		# while i divides n , print i and divide n
		while n % i== 0:
			elements.append(i)
			n = n / i
			
	# Condition if n is a prime
	# number greater than 2
	if n > 2:
		elements.append(int(n))

	#sorted(elements)

	return(elements)
		
# Driver Program to test above function

result=primeFactors(integer)

print (' '.join(str(i)for i in result))