

def  __lowerCamelCase     (			UpperCamelCase__				):







							'''simple docstring'''






							return 10 - x * x





def  __lowerCamelCase     (			UpperCamelCase__       ,							UpperCamelCase__				):







							'''simple docstring'''






							if equation(UpperCamelCase__				) * equation(UpperCamelCase__				) >= 0:
														raise ValueError('Wrong space!'				)

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


if __name__ == "__main__":
					import doctest

					doctest.testmod()

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







def  __lowerCamelCase     (			UpperCamelCase__				):







							'''simple docstring'''






							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  __lowerCamelCase     (			):







							'''simple docstring'''






							snake_case_          =   1
							snake_case_          =   1

							while True:
														i += 1
														t_num += i

														if count_divisors(UpperCamelCase__				) > 500:
																					break

							return t_num


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




