





'''simple docstring'''






import math
def    UpperCamelCase__      (		lowerCAmelCase							,	lowerCAmelCase = 0							,	lowerCAmelCase = 0  ):





      """simple docstring"""


      _lowerCAmelCase							     =							end or len(lowerCAmelCase  )
      for i in range(lowerCAmelCase							,	lowerCAmelCase  ):
            _lowerCAmelCase							     =							i
            _lowerCAmelCase							     =							array[i]
            while temp_index != start and temp_index_value < array[temp_index - 1]:
                  _lowerCAmelCase							     =							array[temp_index - 1]
                  temp_index -= 1
            _lowerCAmelCase							     =							temp_index_value
      return array
def    UpperCamelCase__      (		lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase  ):  # Max Heap





      """simple docstring"""


      _lowerCAmelCase							     =							index
      _lowerCAmelCase							     =							2 * index + 1  # Left Node
      _lowerCAmelCase							     =							2 * index + 2  # Right Node

      if left_index < heap_size and array[largest] < array[left_index]:
            _lowerCAmelCase							     =							left_index

      if right_index < heap_size and array[largest] < array[right_index]:
            _lowerCAmelCase							     =							right_index

      if largest != index:
            _lowerCAmelCase     ,							_lowerCAmelCase							     =							array[largest], array[index]
            heapify(lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase  )
def    UpperCamelCase__      (		lowerCAmelCase  ):





      """simple docstring"""


      _lowerCAmelCase							     =							len(lowerCAmelCase  )

      for i in range(n // 2							,	-1							,	-1  ):
            heapify(lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase  )

      for i in range(n - 1							,	0							,	-1  ):
            _lowerCAmelCase     ,							_lowerCAmelCase							     =							array[0], array[i]
            heapify(lowerCAmelCase							,	0							,	lowerCAmelCase  )

      return array
def    UpperCamelCase__      (		lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase  ):





      """simple docstring"""


      if (array[first_index] > array[middle_index]) != (
          array[first_index] > array[last_index]
      ):
            return array[first_index]
      elif (array[middle_index] > array[first_index]) != (
          array[middle_index] > array[last_index]
      ):
            return array[middle_index]
      else:
            return array[last_index]
def    UpperCamelCase__      (		lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase  ):





      """simple docstring"""


      _lowerCAmelCase							     =							low
      _lowerCAmelCase							     =							high
      while True:
            while array[i] < pivot:
                  i += 1
            j -= 1
            while pivot < array[j]:
                  j -= 1
            if i >= j:
                  return i
            _lowerCAmelCase     ,							_lowerCAmelCase							     =							array[j], array[i]
            i += 1
def    UpperCamelCase__      (		lowerCAmelCase  ):





      """simple docstring"""


      if len(lowerCAmelCase  ) == 0:
            return array
      _lowerCAmelCase							     =							2 * math.ceil(math.loga(len(lowerCAmelCase  )  )  )
      _lowerCAmelCase							     =							16
      return intro_sort(lowerCAmelCase							,	0							,	len(lowerCAmelCase  )							,	lowerCAmelCase							,	lowerCAmelCase  )
def    UpperCamelCase__      (		lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase  ):





      """simple docstring"""


      while end - start > size_threshold:
            if max_depth == 0:
                  return heap_sort(lowerCAmelCase  )
            max_depth -= 1
            _lowerCAmelCase							     =							median_of_a(lowerCAmelCase							,	lowerCAmelCase							,	start + ((end - start) // 2) + 1							,	end - 1  )
            _lowerCAmelCase							     =							partition(lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase  )
            intro_sort(lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase  )
            _lowerCAmelCase							     =							p
      return insertion_sort(lowerCAmelCase							,	lowerCAmelCase							,	lowerCAmelCase  )


if __name__ == "__main__":
      import doctest

      doctest.testmod()

      A__				:   Dict      =input('''Enter numbers separated by a comma : ''').strip()
      A__				:   Dict      =[float(item) for item in user_input.split(''',''')]
      print(sort(unsorted))













from __future__ import annotations

import math


def        SCREAMING_SNAKE_CASE      (       _UpperCAmelCase )			->     bool:

    if 1 < number < 4:
        # 2 and 3 are primes
        return True
    elif number < 2 or number % 2 == 0 or number % 3 == 0:
        # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
        return False

    # All primes number are in format of 6k +/- 1
    for i in range(5						,	int(math.sqrt(_UpperCAmelCase ) + 1 )						,	6 ):
        if number % i == 0 or number % (i + 2) == 0:
            return False
    return True


_UpperCAmelCase				:       Any	   =				[num for num in range(3, 10_00_01, 2) if not is_prime(num)]


def        SCREAMING_SNAKE_CASE      (       _UpperCAmelCase )			->     list[int]:
    if not isinstance(_UpperCAmelCase						,	_UpperCAmelCase ):
        raise ValueError('n must be an integer' )
    if n <= 0:
        raise ValueError('n must be >= 0' )

    lowerCamelCase__    :      int					 =		[]
    for num in range(len(_UpperCAmelCase ) ):
        lowerCamelCase__    :      Union[str, Any]					 =		0
        while 2 * i * i <= odd_composites[num]:
            lowerCamelCase__    :      Dict					 =		odd_composites[num] - 2 * i * i
            if is_prime(_UpperCAmelCase ):
                break
            i += 1
        else:
            list_nums.append(odd_composites[num] )
            if len(_UpperCAmelCase ) == n:
                return list_nums

    return []


def        SCREAMING_SNAKE_CASE      (       )			->     int:
    return compute_nums(1 )[0]


if __name__ == "__main__":
    print(F"""{solution() = }""")





