Python正整数分解质因数，急

def isPrime(n):
    for i in range(2, int(n **0.5) + 1):
        if n % i == 0:
            return False
    return True

data = int(input(">>>"))
k = 2
result = []
while data > 1:
    if data % k ==0 and isPrime(2) :
        result.append(k)
        data = data // k
    else:
        k += 1
        
print(result)