


'''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
	__magic_name__ :					Union[str, Any]  			=  xa * xa + ya * ya
	__magic_name__ :					List[Any]  			=  xa * xa + ya * ya
	__magic_name__ :					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() = }')



'''simple docstring'''

from __future__ import annotations





def lowerCamelCase    (    lowerCAmelCase       :			list[int | float]	,	lowerCAmelCase       :			int	,	lowerCAmelCase       :			int	):





	"""simple docstring"""







	if len(lowerCAmelCase	) == 0:
		raise ValueError('find_min() arg is an empty sequence'	)
	if (
	    left >= len(lowerCAmelCase	)
	    or left < -len(lowerCAmelCase	)
	    or right >= len(lowerCAmelCase	)
	    or right < -len(lowerCAmelCase	)
	):
		raise IndexError('list index out of range'	)
	if left == right:
		return nums[left]
	__magic_name__ :					Tuple  			=  (left + right) >> 1  # the middle
	__magic_name__ :					str  			=  find_min(lowerCAmelCase	,	lowerCAmelCase	,	lowerCAmelCase	)  # find min in range[left, mid]
	__magic_name__ :					Optional[Any]  			=  find_min(lowerCAmelCase	,	mid + 1	,	lowerCAmelCase	)  # find min in range[mid + 1, right]

	return left_min if left_min <= right_min else right_min


if __name__ == "__main__":
							import doctest

							doctest.testmod(verbose=True)