code: def decompose(n):
      primelist = [2, 3]
      for p in primes(primelist):
          if p * p > n:
              break
          while n % p == 0:
              yield p
              n //= p
      if n > 1:
          yield n
  
imports: import math
label_desc: Use image node_id 1 for calling a global function with example usage: decompose(n) without return types