'''simple docstring'''


from itertools import combinations, product


def    _lowerCamelCase       ( lowerCamelCase_   :				int      ,	lowerCamelCase_   :				int      ,	lowerCamelCase_   :				int      ,	lowerCamelCase_   :				int  ):



     """simple docstring"""





     if xa == ya == 0 or xa == ya == 0:
          return False
     UpperCAmelCase_				:  Union[str, Any]  = xa * xa + ya * ya
     UpperCAmelCase_				:  str  = xa * xa + ya * ya
     UpperCAmelCase_				:  str  = (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       ( lowerCamelCase_   :				int = 50  ):



     """simple docstring"""





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


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







from __future__ import annotations



def       __SCREAMING_SNAKE_CASE    (   __UpperCamelCase       :			str      )				->   bool:







  """simple docstring"""





  SCREAMING_SNAKE_CASE__     				= 42
  SCREAMING_SNAKE_CASE__     				= list(__UpperCamelCase      )
  SCREAMING_SNAKE_CASE__				,	SCREAMING_SNAKE_CASE__     				= _vector[:-1], int(_vector[-1]      )
  SCREAMING_SNAKE_CASE__     				= [int(__UpperCamelCase      ) for digit in __vector]

  vector.reverse()
  for i, digit in enumerate(__UpperCamelCase      ):
    if i & 1 == 0:
      SCREAMING_SNAKE_CASE__     				= digit * 2
      if doubled > 9:
        doubled -= 9
      check_digit += doubled
    else:
      check_digit += digit

  return check_digit % 10 == 0


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   assert is_luhn('''79927398713''')
   assert not is_luhn('''79927398714''')
