def prime_factorization(num)
  prime_factor = 2
  arr = []

  until num == 1
    if num % prime_factor == 0
      arr << prime_factor

      num /= prime_factor
    else
      if prime?(num)
        arr << num
        break
      end

      prime_factor += prime_factor == 2 ? 1 : 2
    end
  end

  arr
end

def prime?(i)
  num = 3

  while num <= Math.sqrt(i)
    return false if i % num == 0

    num += 2
  end

  true
end

n = gets.to_i

puts "#{n}: #{prime_factorization(n).join(' ')}"