def 							lowerCAmelCase__    (       a__      )	->int:




  '''simple docstring'''

  return 1 if input_a == 0 else 0


def 							lowerCAmelCase__    (       )	->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 itertools import combinations, product


def 							lowerCAmelCase__    (       a__  ,			a__  ,			a__  ,			a__      )	->bool:




  '''simple docstring'''

  if xa == ya == 0 or xa == ya == 0:
    return False
  _UpperCamelCase				=  xa * xa + ya * ya
  _UpperCamelCase				=  xa * xa + ya * ya
  _UpperCamelCase				=  (xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
  return (
      a_square + b_square == c_square
      or a_square + c_square == b_square
      or b_square + c_square == a_square
  )


def 							lowerCAmelCase__    (       a__ = 50      )	->int:




  '''simple docstring'''

  return sum(
      1
      for pta, pta in combinations(product(range(limit + 1      )  ,			repeat=2      )  ,			2      )
      if is_right(*a__  ,			*a__      )      )


if __name__ == "__main__":
   print(F"{solution() = }")




