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: arr = []
  n = int(input())
  temp = n
  for i in range(2, int(-(-(n**0.5) // 1)) + 1):
      if temp % i == 0:
          cnt = 0
          while temp % i == 0:
              cnt += 1
              temp //= i
          arr.append([i, cnt])
  
  if temp != 1:
      arr.append([temp, 1])
  
  if arr == []:
      arr.append([n, 1])
  
  k = []
  for a, s in arr:
      k += [a] * s
  print(str(n) + ":", *k, sep=" ")
  
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"}]