code: def sieve(n):
      """Yield the primes less than n.
  
      >>> list(sieve(30))
      [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
      """
      data = bytearray((0, 1)) * (n // 2)
      data[:3] = 0, 0, 0
      limit = math.isqrt(n) + 1
      for p in compress(range(limit), data):
          data[p * p : n : p + p] = bytes(len(range(p * p, n, p + p)))
      data[2] = 1
      return iter_index(data, 1) if n > 2 else iter([])
  
imports: import math
  import operator
  from collections import deque
  from collections.abc import Sized
  from functools import partial, reduce
  from itertools import chain, combinations, compress, count, cycle, groupby, islice, product, repeat, starmap, tee, zip_longest
  from random import randrange, sample, choice
label_desc: Use image node_id 37 for calling a global function with example usage: sieve(n) and returns: unknown