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

def firstPrimeDivisor(n):
    for i in range(2,n/2):
        if (isPrime(i) and n%i is 0):
            return i
    return -1 #n is a prime number

def findDivs(n):
    divs = []
    done = False
    m = n
    while(done):
        i = firstPrimeDivisor(m)
        if i is -1:
            done = True
            break
        m /= i
        divs.append(i)
    return divs