

"""simple docstring"""






def  UpperCamelCase   (     _lowerCAmelCase       :  int,					_lowerCAmelCase       :  int	)			->     int:
	return (input_a, input_a).count(0	) % 2
def  UpperCamelCase   (     )			->     None:
	assert xor_gate(0,					0	) == 0
	assert xor_gate(0,					1	) == 1
	assert xor_gate(1,					0	) == 1
	assert xor_gate(1,					1	) == 0


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








"""simple docstring"""






import math
def  UpperCamelCase   (     _lowerCAmelCase       :  int	)			->     bool:

	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  UpperCamelCase   (     _lowerCAmelCase       :  int = 2000000	)			->     int:
	return sum(num for num in range(3,					_lowerCAmelCase,					2	) if is_prime(_lowerCAmelCase	)	) + 2 if n > 2 else 0


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





