





import math


def 	UpperCamelCase__(       UpperCamelCase__			:       int  )->bool:
       assert isinstance(UpperCamelCase__ ,     UpperCamelCase__  ) 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

       A__											=						range(3 ,     int(math.sqrt(UpperCamelCase__  ) + 1  ) ,     2  )
       return not any(not number % i for i in odd_numbers  )


def 	UpperCamelCase__(       UpperCamelCase__			:       Any ,     UpperCamelCase__			:       List[Any]=1 ,     **UpperCamelCase__			:       List[str]  )->str:
       A__											=						factor * value
       A__											=						value

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

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












import numpy as np


def 	UpperCamelCase__(       UpperCamelCase__			:       np.array  )->np.array:
       return (2 / (1 + np.exp(-2 * vector  ))) - 1


if __name__ == "__main__":
       import doctest

       doctest.testmod()





