


'''simple docstring'''




from math import sqrt

def       __UpperCamelCase     (     _A     :					int					)     ->   list[int]:




	"""simple docstring"""





	lowerCAmelCase       :     Tuple   				=			[1]
	for i in range(2       , int(sqrt(_A					)					) + 1       , 1					):
		if number % i == 0:
			values.append(_A					)
			if int(number // i					) != i:
				values.append(int(number // i					)					)
	return sorted(_A					)

def       __UpperCamelCase     (     _A     :					int					)     ->   bool:




	"""simple docstring"""





	return sum(factors(_A					)					) > n

def       __UpperCamelCase     (     _A     :					int					)     ->   bool:




	"""simple docstring"""





	lowerCAmelCase       :     Optional[Any]   				=			factors(_A					)
	lowerCAmelCase       :     List[Any]   				=			len(_A					)
	lowerCAmelCase       :     List[Any]   				=			[[0 for i in range(number + 1					)] for j in range(r + 1					)]
	for i in range(r + 1					):
		lowerCAmelCase       :     Any   				=			True

	for i in range(1       , number + 1					):
		lowerCAmelCase       :     Any   				=			False

	for i in range(1       , r + 1					):
		for j in range(1       , number + 1					):
			if j < values[i - 1]:
				lowerCAmelCase       :     Union[str, Any]   				=			subset[i - 1][j]
			else:
				lowerCAmelCase       :     List[Any]   				=			subset[i - 1][j] or subset[i - 1][j - values[i - 1]]

	return subset[r][number] != 0

def       __UpperCamelCase     (     _A     :					int					)     ->   bool:




	"""simple docstring"""





	return abundant(_A					) and not semi_perfect(_A					)


if __name__ == "__main__":
				import doctest

				doctest.testmod(verbose=True)
				for number in (69, 70, 71):
								print(f"""{number} is {'' if weird(number) else 'not '}weird.""")




'''simple docstring'''




from itertools import combinations, product

def       __UpperCamelCase     (     _A     :					int       , _A     :					int       , _A     :					int       , _A     :					int					)     ->   bool:




	"""simple docstring"""





	if xa == ya == 0 or xa == ya == 0:
		return False
	lowerCAmelCase       :     Optional[Any]   				=			xa * xa + ya * ya
	lowerCAmelCase       :     Tuple   				=			xa * xa + ya * ya
	lowerCAmelCase       :     List[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       __UpperCamelCase     (     _A     :					int = 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() = }""")
