
import math


def     UpperCAmelCase_  (						__lowerCAmelCase	) ->						List[Any]:
    assert isinstance(lowerCAmelCase__	,					lowerCAmelCase__	) and (
        number >= 0
    ), "'number' must been an int and positive"

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

    __lowercase		:			Union[str, Any]	    =       range(3	,					int(math.sqrt(lowerCAmelCase__	) + 1	)	,					2	)
    return not any(not number % i for i in odd_numbers	)





def     UpperCAmelCase_  (						__lowerCAmelCase	,					__lowerCAmelCase=1	,					**__lowerCAmelCase	) ->						Optional[Any]:
    __lowercase		:			Union[str, Any]	    =       factor * value
    __lowercase		:			List[Any]	    =       value

    while not is_prime(lowerCAmelCase__	):
        value += 1 if not ("desc" in kwargs and kwargs["desc"] is True) else -1

    if value == first_value_val:
        return next_prime(value + 1	,					**lowerCAmelCase__	)
    return value




from __future__ import annotations


def     UpperCAmelCase_  (						__lowerCAmelCase	) ->						int:
    if not nums:
        return 0
    __lowercase		:			List[Any]	    =       nums[0]
    __lowercase		:			Union[str, Any]	    =       0
    for num in nums[1:]:
        __lowercase    ,      __lowercase		:			Dict	    =       (
            max_excluding + num,
            max(__lowerCAmelCase	,					__lowerCAmelCase	),
        )
    return max(__lowerCAmelCase	,					__lowerCAmelCase	)


if __name__ == "__main__":
 import doctest

 doctest.testmod()


