






'''simple docstring'''







def 			__UpperCamelCase				(			lowercase_					:     list      ,					lowercase_					:     int      ,					lowercase_					:     int      ,					lowercase_					:     int      ):
       """simple docstring"""




       a_	    = int((lower_bound + upper_bound) // 2      )
       if array[r] == value:
              return r
       if lower_bound >= upper_bound:
              return -1
       if array[r] < value:
              return binary_search(lowercase_      ,					r + 1      ,					lowercase_      ,					lowercase_      )
       else:
              return binary_search(lowercase_      ,					lowercase_      ,					r - 1      ,					lowercase_      )


def 			__UpperCamelCase				(			lowercase_					:     int      ,					lowercase_					:     list      ):
       """simple docstring"""




       a_	    = 0
       if matrix[index][0] == value:
              return [index, 0]
       while index < len(lowercase_      ) and matrix[index][0] < value:
              a_	    = binary_search(matrix[index]      ,					0      ,					len(matrix[index]      ) - 1      ,					lowercase_      )
              if r != -1:
                     return [index, r]
              index += 1
       return [-1, -1]


if __name__ == "__main__":
  import doctest

  doctest.testmod()












'''simple docstring'''







def 			__UpperCamelCase				(			lowercase_					:     int      ,					lowercase_					:     int      ):
       """simple docstring"""




       return (input_a, input_a).count(0      ) % 2


def 			__UpperCamelCase				(			):
       """simple docstring"""




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




