



from itertools import combinations, product

def      A_ (		__a       :			int	,						__a       :			int	,						__a       :			int	,						__a       :			int						):

				"""simple docstring"""
				if xa == ya == 0 or xa == ya == 0:
								return False
				a__			 =						xa * xa + ya * ya
				a__			 =						xa * xa + ya * ya
				a__			 =						(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      A_ (		__a       :			int = 50						):

				"""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() = }""")






def      A_ (		__a       :			int						):

				"""simple docstring"""
				if number != int(__a						):
								raise ValueError("""factorial() only accepts integral values"""						)
				if number < 0:
								raise ValueError("""factorial() not defined for negative values"""						)
				a__			 =						1
				for i in range(1	,						number + 1						):
								value *= i
				return value

def      A_ (		__a       :			int						):

				"""simple docstring"""
				if not isinstance(__a	,						__a						):
								raise ValueError("""factorial() only accepts integral values"""						)
				if n < 0:
								raise ValueError("""factorial() not defined for negative values"""						)
				return 1 if n == 0 or n == 1 else n * factorial(n - 1						)


if __name__ == "__main__":
	import doctest

	doctest.testmod()

	UpperCAmelCase								=   int(input("""Enter a positive integer: """).strip() or 0)
	print(f"""factorial{n} is {factorial(n)}""")

