def primes(n):
    list = [2]
    i = 2
    while i < n:
        i += 1
        prime = True
        for j in list:
            if i % j == 0:
                prime = False
                break
        if prime:
            list.append(i)
    return list
        
def primefactorization(n):
    list = primes(n)
    factorization = { }
    for p in list:
        count = 0
        while n % p == 0:
            n = n/p
            count += 1
        if count != 0:
            factorization[p]= count
    return factorization

def printfactorization(n):
    factors = primefactorization(n)
    primes = factors.keys()
    primes.sort()
    result = ''
    for p in primes:
        result += str(p) + '**' + str(factors[p]) + " "
    return result