


import math
def 							UpperCamelCase_(					_A :int	)->		str:
			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

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







def 							UpperCamelCase_(					_A :Optional[Any]					,  _A :Optional[int]=1					,  **_A :str	)->		List[Any]:
			UpperCamelCase__       =							factor * value
			UpperCamelCase__       =							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







"""simple docstring"""







def  __SCREAMING_SNAKE_CASE		(			lowerCamelCase_:							int     ,		lowerCamelCase_:							int ):
						"""simple docstring"""






						return int((input_a, input_a).count(0 ) != 0 )

def  __SCREAMING_SNAKE_CASE		(			):
						"""simple docstring"""






						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))



