import numpy as np
    
def fuck_prime(m):
    if m<=1:
        return False
    for i in range(2, int(m ** 0.5) + 1):
        if m % i == 0:
            return False
    return True

primes = np.array([]) 

for i in range(2,51):
    if fuck_prime(i):
        primes = np.append(primes, i)
pass

def prime_factors_with_primes(n, primes_array):
    factors = []
    temp = n
    
    for p in primes_array:
        if p * p > temp:
            break
        
        while temp % p == 0:
            factors.append(int(p))
            temp //= p
    
    if temp > 1:
        factors.append(int(temp))
    
    return factors

num = int(input("请输入正整数: "))

if num <= 0:
    print("请输入正整数！")
else:
    factors = prime_factors_with_primes(num, primes)
    print(f"{num} = {' * '.join(map(str, factors))}")