Prime Factors

def solve(n):
    factors = []
    i = 2
    original = n
    while i * i <= n:
        if n % i == 0:
            count = 0
            while n % i == 0:
                n //= i
                count += 1
            if count == 1:
                factors.append(str(i))
            else:
                factors.append(f'{i}^{count}')
        i += 1
    if n > 1:
        factors.append(str(n))
    print(f'{original}={"*".join(factors)}')