

'''simple docstring'''





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






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


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













"""simple docstring"""





def   a    (     __UpperCAmelCase      :    int = 1_0_0  )    ->							int:
						__magic_name__:	str							=       0
						__magic_name__:	Any							=       0
						for i in range(1      ,   n + 1  ):
												sum_of_squares += i**2
												sum_of_ints += i
						return sum_of_ints**2 - sum_of_squares


if __name__ == "__main__":
							print(f'''{solution() = }''')



