output_description: Print the given integer n and :. Then, print prime factors in ascending order.
  If n is divisible by a prime factor several times, the prime factor should be
  printed according to the number of times. Print a space before each prime
  factor.
input_description: n
      
  
  An integer n is given in a line.
attempt: n = int(input())
  m = str(n) + ":"
  a = True
  l = n
  i = 2
  while a:
      if l % i == 0:
          l /= i
          m += " " + str(i)
          i -= 1
      a = i < l**0.5
      i += 1
  if l != 1:
      m += " " + str(int(l))
  print(m)
  
problem_description: Prime Factorization
  
    
  
  Factorize a given integer n.
samples: [{"input": "12", "output": "12: 2 2 3"}, {"input": "126", "output": "126: 2 3 3 7"}]