def is_prime(n):
    for i in range(2, n - 1):
        if n % i == 0:
            return False
    return True


def prime_factors(n: int) -> list:
    x = n
    c = 2
    result = []
    while x > 1:

        if x % c == 0:
            result.append(c)
            x //= c
        else:
            c += 1

    print(result)


prime_factors(1)