def 							lowerCAmelCase(	__lowerCamelCase      ,				__lowerCamelCase						):
					return (input_a, input_a).count(0						) % 2
def 							lowerCAmelCase(	):
					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"""




from __future__ import annotations

def   UpperCamelCase_  (		SCREAMING_SNAKE_CASE_,     SCREAMING_SNAKE_CASE_,     SCREAMING_SNAKE_CASE_,     SCREAMING_SNAKE_CASE_			):
					SCREAMING_SNAKE_CASE	,    SCREAMING_SNAKE_CASE				=	m - 1, 0
					while i >= 0 and j < n:
										if key == mat[i][j]:
															print(f'''Key {key} found at row- {i + 1} column- {j + 1}'''			)
															return
										if key < mat[i][j]:
															i -= 1
										else:
															j += 1
					print(f'''Key {key} not found'''			)

def   UpperCamelCase_  (		):
					SCREAMING_SNAKE_CASE				=	[[2, 5, 7], [4, 8, 1_3], [9, 1_1, 1_5], [1_2, 1_7, 2_0]]
					SCREAMING_SNAKE_CASE				=	int(input('Enter the element to be searched:'			)			)
					print(SCREAMING_SNAKE_CASE_			)
					search_in_a_sorted_matrix(SCREAMING_SNAKE_CASE_,     len(SCREAMING_SNAKE_CASE_			),     len(mat[0]			),     SCREAMING_SNAKE_CASE_			)


if __name__ == "__main__":
	import doctest

	doctest.testmod()
	main()
