






def   lowerCamelCase__			(     ):

  """simple docstring"""






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


def   lowerCamelCase__			(     lowercase				):

  """simple docstring"""






  SCREAMING_SNAKE_CASE       :      List[Any]							=    1
  SCREAMING_SNAKE_CASE       :      Optional[Any]							=    2
  while i * i <= n:
    SCREAMING_SNAKE_CASE       :      str							=    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   lowerCamelCase__			(     ):

  """simple docstring"""






  return next(i for i in triangle_number_generator() if count_divisors(lowercase				) > 500				)


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














def   lowerCamelCase__			(     lowercase						,     lowercase				):

  """simple docstring"""






  return numa ^ numa < 0


if __name__ == "__main__":
   import doctest

   doctest.testmod()






