

from abc import ABC, abstractmethod
from argparse import ArgumentParser

class    _lowercase				(					_SCREAMING_SNAKE_CASE			):

   @staticmethod
   @abstractmethod
   def     UpperCamelCase					(				lowerCamelCase__	:    List[Any]       ) ->			Union[str, Any]:
         """simple docstring"""





         raise NotImplementedError()





   @abstractmethod
   def     UpperCamelCase					(				self	:    Tuple       ) ->			int:
         """simple docstring"""





         raise NotImplementedError()







'''simple docstring'''



def A ():
						for n in range(1					,      1000000						):
												yield n * (n + 1) // 2


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


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