P.baow

from sys import exit
div=[]
num=int(input("Enter a positive integer greater than 1: "))
if num<=1:
    print("Input must be greater than 1")
    exit()
n=2
k=num
while True:
    if num%n==0:
        num=num/n
        div.append(n)
    else:
        n=n+1
    if n==k:
        break
if num!=1:
    div.append(int(num))
print(f"Prime factorization of {k} is:")
div.sort()
for i in div :
    print(i)