def findFactors(num: int)->list:
factors=[]
for i in range(1,num+1):
if num%i==0:
factors.append(i)
return factors
def find_factors(num: int) -> list:
return [i for i in range(1, num + 1) if num % i == 0]
# print(find_Factors(6))
# [1, 2, 3]
def Prime_Factorial(n):
if n < 4:
return n
arr = []
while n > 1:
for i in range(2, int(2+n//2)):
if i == (1 + n // 2):
arr.append(n)
n = n // n
if n % i == 0:
arr.append(i)
n = n // i
break
return arr
n = 210
print(Prime_Factorial(n))