





def    __UpperCamelCase      (    a) ->Optional[Any]:
					lowerCamelCase__       =       1
					lowerCamelCase__       =       2
					while i * i <= n:
										lowerCamelCase__       =       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      (    ) ->Optional[Any]:
					lowerCamelCase__       =       1
					lowerCamelCase__       =       1

					while True:
										i += 1
										t_num += i

										if count_divisors(a) > 500:
															break

					return t_num


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








def    __UpperCamelCase      (    a) ->float:
					return 10 - x * x





def    __UpperCamelCase      (    a,     a) ->float:
					# Bolzano theory in order to find if there is a root between a and b
					if equation(a) * equation(a) >= 0:
										raise ValueError("Wrong space!")

					lowerCamelCase__       =       a
					while (b - a) >= 0.0_1:
										# Find middle point
										lowerCamelCase__       =       (a + b) / 2
										# Check if middle point is root
										if equation(a) == 0.0:
															break
										# Decide the side to repeat the steps
										if equation(a) * equation(a) < 0:
															lowerCamelCase__       =       c
										else:
															lowerCamelCase__       =       c
					return c


if __name__ == "__main__":
						import doctest

						doctest.testmod()

						print(bisection(-2, 5))
						print(bisection(0, 6))

