
"""simple docstring"""


from itertools import combinations, product



def        _lowerCamelCase(__UpperCamelCase       ,					__UpperCamelCase       ,					__UpperCamelCase       ,					__UpperCamelCase			)							->					bool:
	if xa == ya == 0 or xa == ya == 0:
		return False
	_lowerCAmelCase								=xa * xa + ya * ya
	_lowerCAmelCase								=xa * xa + ya * ya
	_lowerCAmelCase								=(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(__UpperCamelCase = 50			)							->					int:
	return sum(
	    1
	    for pta, pta in combinations(product(range(limit + 1			)       ,					repeat=2			)       ,					2			)
	    if is_right(*__UpperCamelCase       ,					*__UpperCamelCase			)			)


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





"""simple docstring"""


def        _lowerCamelCase(__UpperCamelCase = 20			)							->					int:

	try:
		_lowerCAmelCase								=int(__UpperCamelCase			)
	except (TypeError, ValueError):
		raise TypeError("""Parameter n must be int or castable to int."""			)
	if n <= 0:
		raise ValueError("""Parameter n must be greater than or equal to one."""			)
	_lowerCAmelCase								=0
	while 1:
		i += n * (n - 1)
		_lowerCAmelCase								=0
		for j in range(2       ,					__UpperCamelCase			):
			if i % j != 0:
				_lowerCAmelCase								=1
				break
		if nfound == 0:
			if i == 0:
				_lowerCAmelCase								=1
			return i
	return None


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



