




import math







def lowerCamelCase__  (     _lowercase ):

     '''simple docstring'''


     assert isinstance(_lowercase					,		_lowercase ) 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

     UpperCAmelCase_     :				str  =     range(3					,		int(math.sqrt(_lowercase ) + 1 )					,		2 )
     return not any(not number % i for i in odd_numbers )







def lowerCamelCase__  (     _lowercase					,		_lowercase=1					,		**_lowercase ):

     '''simple docstring'''


     UpperCAmelCase_     :				Any  =     factor * value
     UpperCAmelCase_     :				List[str]  =     value

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

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




'''simple docstring'''
def A__       (	UpperCAmelCase_    ,    UpperCAmelCase_				):
						return int((input_a, input_a).count(0				) != 0				)






def A__       (	):
						assert nand_gate(0    ,    0				) == 1
						assert nand_gate(0    ,    1				) == 1
						assert nand_gate(1    ,    0				) == 1
						assert nand_gate(1    ,    1				) == 0


if __name__ == "__main__":
					print(nand_gate(0, 0))
					print(nand_gate(0, 1))
					print(nand_gate(1, 0))
					print(nand_gate(1, 1))


