





from __future__ import annotations


def        SCREAMING_SNAKE_CASE      (       _UpperCAmelCase						,	_UpperCAmelCase = None						,	_UpperCAmelCase = None )			->     None:
    if start is None:
        lowerCamelCase__    :      Optional[int]					 =		0

    if end is None:
        lowerCamelCase__    :      Tuple					 =		len(_UpperCAmelCase ) - 1

    if start >= end:
        return

    lowerCamelCase__    :      List[str]					 =		(start + end) // 2

    slowsort(_UpperCAmelCase						,	_UpperCAmelCase						,	_UpperCAmelCase )
    slowsort(_UpperCAmelCase						,	mid + 1						,	_UpperCAmelCase )

    if sequence[end] < sequence[mid]:
        lowerCamelCase__ ,							lowerCamelCase__    :      Optional[Any]					 =		sequence[mid], sequence[end]

    slowsort(_UpperCAmelCase						,	_UpperCAmelCase						,	end - 1 )


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

    testmod()












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() = }""")





