
def 	lowercase_							(A			:			Dict		, A			:			Optional[int]				):







       for index, item in enumerate(lowercase_				):
              if item == target:
                     return index
       return -1
def 	lowercase_							(A			:			Dict		, A			:			Union[str, Any]		, A			:			List[str]		, A			:			Optional[Any]				):







       if not (0 <= high < len(lowercase_				) and 0 <= low < len(lowercase_				)):
              raise Exception('Invalid upper or lower bound!'				)
       if high < low:
              return -1
       if sequence[low] == target:
              return low
       if sequence[high] == target:
              return high
       return rec_linear_search(lowercase_		, low + 1		, high - 1		, lowercase_				)


if __name__ == "__main__":
 a_       :Optional[Any]				  =				input("Enter numbers separated by comma:\n").strip()
 a_       :Union[str, Any]				  =				[int(item.strip()) for item in user_input.split(",")]

 a_       :Optional[Any]				  =				int(input("Enter a single number to be found in the list:\n").strip())
 a_       :Union[str, Any]				  =				linear_search(sequence, target)
 if result != -1:
  print(F"""linear_search({sequence}, {target}) = {result}""")
 else:
  print(F"""{target} was not found in {sequence}""")











def 	lowercase_							(A			:			int		, A			:			int				):
       return (input_a, input_a).count(0				) % 2
def 	lowercase_							():
       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))






