





'''simple docstring'''



def 				_lowerCAmelCase  (			lowerCamelCase_     :					float			):
			return 1_0 - x * x




def 				_lowerCAmelCase  (			lowerCamelCase_     :					float						,    lowerCamelCase_     :					float			):
			# Bolzano theory in order to find if there is a root between a and b
			if equation(lowerCamelCase_			) * equation(lowerCamelCase_			) >= 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(lowerCamelCase_			) == 0.0:
									break
						# Decide the side to repeat the steps
						if equation(lowerCamelCase_			) * equation(lowerCamelCase_			) < 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 				_lowerCAmelCase  (			lowerCamelCase_     :					int = 6_0_0_8_5_1_4_7_5_1_4_3			):

			try:
						__lowercase			  =							int(lowerCamelCase_			)
			except (TypeError, ValueError):
						raise TypeError('''Parameter n must be int or castable to int.'''			)
			if n <= 0:
						raise ValueError('''Parameter n must be greater than or equal to one.'''			)
			__lowercase			  =							1
			__lowercase			  =							2
			while i * i <= n:
						while n % i == 0:
									__lowercase			  =							i
									n //= i
						i += 1
			if n > 1:
						__lowercase			  =							n
			return int(lowerCamelCase_			)


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





