def       __lowerCamelCase		(						lowerCAmelCase__	):

       for insert_index, insert_value in enumerate(collection[1:]	):
              lowerCAmelCase__     	=					insert_index
              while insert_index >= 0 and insert_value < collection[insert_index]:
                     lowerCAmelCase__     	=					collection[insert_index]
                     insert_index -= 1
              if insert_index != temp_index:
                     lowerCAmelCase__     	=					insert_value
       return collection


if __name__ == "__main__":
    from doctest import testmod

    testmod()

    lowerCAmelCase__							= input('Enter numbers separated by a comma:\n').strip()
    lowerCAmelCase__							= [int(item) for item in user_input.split(',')]
    print(F'{insertion_sort(unsorted) = }')








import math
from collections.abc import Generator


def      lowerCamelCase__	(   lowercase ):

  """simple docstring"""






  SCREAMING_SNAKE_CASE				:					Generator		  =			(i for i in range(1  ,   (max_n + 1) ))
  for i in (n for n in numbers if n > 1):
    for j in range(2  ,   lowercase ):
      if (i % j) == 0:
        break
    else:
      yield i


def      lowerCamelCase__	(   lowercase ):

  """simple docstring"""






  SCREAMING_SNAKE_CASE				:					Generator		  =			(i for i in range(1  ,   (max_n + 1) ))
  for i in (n for n in numbers if n > 1):
    # only need to check for factors up to sqrt(i)
    SCREAMING_SNAKE_CASE				:					str		  =			int(math.sqrt(lowercase ) ) + 1
    for j in range(2  ,   lowercase ):
      if (i % j) == 0:
        break
    else:
      yield i


def      lowerCamelCase__	(   lowercase ):

  """simple docstring"""






  SCREAMING_SNAKE_CASE				:					Generator		  =			(i for i in range(1  ,   (max_n + 1)  ,   2 ))
  # It's useless to test even numbers as they will not be prime
  if max_n > 2:
    yield 2  # Because 2 will not be tested, it's necessary to yield it now
  for i in (n for n in numbers if n > 1):
    SCREAMING_SNAKE_CASE				:					Optional[Any]		  =			int(math.sqrt(lowercase ) ) + 1
    for j in range(3  ,   lowercase  ,   2 ):
      # As we removed the even numbers, we don't need them now
      if (i % j) == 0:
        break
    else:
      yield i


def      lowerCamelCase__	(   ):

  """simple docstring"""






  from timeit import timeit

  SCREAMING_SNAKE_CASE				:					Tuple		  =			"from __main__ import slow_primes, primes, fast_primes"
  print(timeit("slow_primes(1_000_000_000_000)"  ,   setup=lowercase  ,   number=1000000 ) )
  print(timeit("primes(1_000_000_000_000)"  ,   setup=lowercase  ,   number=1000000 ) )
  print(timeit("fast_primes(1_000_000_000_000)"  ,   setup=lowercase  ,   number=1000000 ) )


if __name__ == "__main__":
   snake_case			 =						int(input("""Calculate primes up to:\n>> """).strip())
   for ret in primes(number):
      print(ret)
   benchmark()






