

"""simple docstring"""




def 						UpperCAmelCase__ (					A__						,     A__ )   ->   int:




   """simple docstring"""
   return (input_a, input_a).count(0 ) % 2



def 						UpperCAmelCase__ (					)   ->   None:




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







"""simple docstring"""




from __future__ import annotations



def 						UpperCAmelCase__ (					A__						,     A__						,     A__						,     A__ )   ->   None:




   """simple docstring"""
   lowerCamelCase__       ,							lowerCamelCase__						       =      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__ (					)   ->   None:




   """simple docstring"""
   lowerCamelCase__						       =      [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
   lowerCamelCase__						       =      int(input("Enter the element to be searched:" ) )
   print(A__ )
   search_in_a_sorted_matrix(A__						,     len(A__ )						,     len(mat[0] )						,     A__ )


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     main()




