



'''simple docstring'''






def  snake_case_     (					)      ->   Any:
							for n in range(1   ,      1000000  ):
														yield n * (n + 1) // 2


def  snake_case_     (					_lowerCAmelCase  :						List[Any]  )      ->   Optional[int]:
							UpperCAmelCase :       List[str] 							=		1
							UpperCAmelCase :       int 							=		2
							while i * i <= n:
														UpperCAmelCase :       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  snake_case_     (					)      ->   Optional[Any]:
							return next(i for i in triangle_number_generator() if count_divisors(a_  ) > 500  )


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













from typing import TYPE_CHECKING

from ...utils import _LazyModule


lowercase  							=					{"processing_wav2vec2_with_lm": ["Wav2Vec2ProcessorWithLM"]}


if TYPE_CHECKING:
	from .processing_wavaveca_with_lm import WavaVecaProcessorWithLM
else:
	import sys

	lowercase  							=					_LazyModule(__name__, globals()["__file__"], _import_structure, module_spec=__spec__)





