차뭏뭏

def solution(n):
    answer = []
    for i in range(2,n+1):
        pre = 0
        while pre != n:
            pre = n
            if n%i==0:
                if not i in answer:
                    answer.append(i)
                n = n//i
        if n==1:
            break
    
    return answer