





def _A  (       __magic_name__			):
   return 10 - x * x


def _A  (       __magic_name__    ,   __magic_name__			):





   if equation(__magic_name__			) * equation(__magic_name__			) >= 0:
      raise ValueError("Wrong space!"			)

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


if __name__ == "__main__":
  import doctest

  doctest.testmod()

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










'''simple docstring'''


def 		_lowercase (SCREAMING_SNAKE_CASE							):




     '''simple docstring'''





     __A	:       List[str]      =							1
     __A	:       Union[str, Any]      =							2
     while i * i <= n:
          __A	:       List[Any]      =							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 		_lowercase ():




     '''simple docstring'''





     __A	:       Optional[Any]      =							1
     __A	:       Dict      =							1

     while True:
          i += 1
          t_num += i

          if count_divisors(SCREAMING_SNAKE_CASE							) > 500:
               break

     return t_num


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

