用素数因子分解一个正整数

def prime(x):
    if(x==1):
        return 1
    elif(x==2):
        return 1
    elif(x%1==0):
        for i in range(2,x):
            if(x%i==0):
                return 0
                break
            if(i==x-1):
                return 1
    else:
        return 0
x=int(input())
a_list=[]
b_list=[]
for i in range(2,x+1):
    if(prime(i)):
        if(x%i==0):
            a_list.append(i)
if(x==1):
    b_list=[1]
while(x!=1):
    for j in a_list:
        if(x%j==0):
            b_list.append(j)
            x=x/j
            break

m=str(b_list)
m=m.replace("]","")
m=m.replace("[","")
print(m)