





def _a       (			lowerCamelCase:     int				)			->		int:







      '''simple docstring'''






      return 1 if input_a == 0 else 0



def _a       (			)			->		None:







      '''simple docstring'''






      assert not_gate(0				) == 1
      assert not_gate(1				) == 0


if __name__ == "__main__":
       print(not_gate(0))
       print(not_gate(1))












from __future__ import annotations



def _a       (			lowerCamelCase:     list[list[int]]      ,       lowerCamelCase:     int      ,       lowerCamelCase:     int      ,       lowerCamelCase:     int | float				)			->		None:







      '''simple docstring'''






      __A     ,		__A      =       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 _a       (			)			->		None:







      '''simple docstring'''






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


if __name__ == "__main__":
       import doctest

       doctest.testmod()
       main()





