





"""simple docstring"""






def       __A (     )						->						Optional[Any]:
				for n in range(1				,    1_00_00_00):
								yield n * (n + 1) // 2

def       __A (     a_  :Tuple)						->						List[Any]:
				__a	:  List[str]         =					1
				__a	:  Optional[Any]         =					2
				while i * i <= n:
								__a	:  Union[str, Any]         =					0
								while n % i == 0:
												n //= i
												multiplicity += 1
								divisors_count *= multiplicity + 1
								i += 1
				if n > 1:
								divisors_count *= 2
				return divisors_count

def       __A (     )						->						Tuple:
				return next(i for i in triangle_number_generator() if count_divisors(a_) > 5_00)


if __name__ == "__main__":
		print(solution())






"""simple docstring"""






def       __A (     a_  :float)						->						float:

				if edge <= 0 or not isinstance(a_				,    a_):
								raise ValueError('''Length must be a positive.''')
				return 3 * ((25 + 10 * (5 ** (1 / 2))) ** (1 / 2)) * (edge**2)

def       __A (     a_  :float)						->						float:

				if edge <= 0 or not isinstance(a_				,    a_):
								raise ValueError('''Length must be a positive.''')
				return ((15 + (7 * (5 ** (1 / 2)))) / 4) * (edge**3)


if __name__ == "__main__":
		import doctest

		doctest.testmod()