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: X = int(input())
  temp = X
  ret = repr(X) + ":"
  for cnt in range(2, X):
      while temp % cnt == 0:
          temp = temp / cnt
          ret += " " + repr(cnt)
      cnt += 1
  print(ret)
  
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"}]