


def 							lowerCAmelCase_	(   __lowerCamelCase				,      __lowerCamelCase      ):
							return int((input_a, input_a).count(0      ) == 0      )







def 							lowerCAmelCase_	(   ):
							assert and_gate(0				,      0      ) == 0
							assert and_gate(0				,      1      ) == 0
							assert and_gate(1				,      0      ) == 0
							assert and_gate(1				,      1      ) == 1


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


"""simple docstring"""



import math
from collections.abc import Iterator
from itertools import takewhile

def  _A(		lowerCAmelCase							):

							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(lowerCAmelCase							) + 1							)			,  6							):
														if number % i == 0 or number % (i + 2) == 0:
																					return False
							return True

def  _A(		):
							A__       :     List[str]								=			2
							while True:
														if is_prime(lowerCAmelCase							):
																					yield num
														num += 1

def  _A(		lowerCAmelCase = 200_0000							):
							return sum(takewhile(lambda lowerCAmelCase							: x < n			,  prime_generator()							)							)


if __name__ == "__main__":
				print(F'{solution() = }')





