




'''simple docstring'''

def __UpperCAmelCase	(   _UpperCAmelCase		:   int						)      ->      Tuple:
			__snake_case			=		1
			__snake_case			=		2
			while i * i <= n:
						__snake_case			=		0
						while n % i == 0:
									n //= i
									multiplicity += 1
						n_divisors *= multiplicity + 1
						i += 1
			if n > 1:
						n_divisors *= 2
			return n_divisors


def __UpperCAmelCase	(   )      ->      Tuple:
			__snake_case			=		1
			__snake_case			=		1

			while True:
						i += 1
						t_num += i

						if count_divisors(_UpperCAmelCase						) > 5_00:
									break

			return t_num


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












'''simple docstring'''




def 			_lowerCAmelCase     (    __snake_case    :					int					,				__snake_case    :					int					,				__snake_case    :					int     )	->	float:
     __A		:					Dict						=			(num_of_terms / 2) * (2 * first_term + (num_of_terms - 1) * common_diff)
     # formula for sum of series
     return total






def 			_lowerCAmelCase     (    )	->	Union[str, Any]:
     print(sum_of_series(1					,				1					,				10     )     )


if __name__ == "__main__":
  import doctest

  doctest.testmod()