





from collections.abc import Callable







def   __lowerCamelCase   (				__a  :Any       ,	__a  :Optional[int]       ,	__a  :Optional[Any]       )						->							float:






		"""simple docstring"""

		A__     =  a
		A__     =  b
		if function(__lowerCAmelCase       ) == 0:  # one of the a or b is a root for the function
				return a
		elif function(__lowerCAmelCase       ) == 0:
				return b
		elif (
		    function(__lowerCAmelCase       ) * function(__lowerCAmelCase       ) > 0
		):  # if none of these are root and they are both positive or negative,
				# then this algorithm can't find the root
				raise ValueError("""could not find root in given interval."""       )
		else:
				A__     =  start + (end - start) / 2.0
				while abs(start - mid       ) > 1_0**-7:  # until precisely equals to 10^-7
						if function(__lowerCAmelCase       ) == 0:
								return mid
						elif function(__lowerCAmelCase       ) * function(__lowerCAmelCase       ) < 0:
								A__     =  mid
						else:
								A__     =  mid
						A__     =  start + (end - start) / 2.0
				return mid







def   __lowerCamelCase   (				__a  :Any       )						->							float:






		"""simple docstring"""

		return x**3 - 2 * x - 5


if __name__ == "__main__":
					print(bisection(f, 1, 1_0_0_0))

					import doctest

					doctest.testmod()




"""simple docstring"""


def      lowerCamelCase_					(   __lowerCAmelCase							)				->   list:




						'''simple docstring'''



						if len(__lowerCAmelCase							) <= 1:
												return [tuple(__lowerCAmelCase							)]

						lowerCamelCase__   =[]

						def generate(__lowerCAmelCase  ,       __lowerCAmelCase							):
												lowerCamelCase__   =[0] * n
												res.append(tuple(__lowerCAmelCase							)							)

												lowerCamelCase__   =0
												while i < n:
																		if c[i] < i:
																								if i % 2 == 0:
																														lowerCamelCase__   , lowerCamelCase__   =arr[i], arr[0]
																								else:
																														lowerCamelCase__   , lowerCamelCase__   =arr[i], arr[c[i]]
																								res.append(tuple(__lowerCAmelCase							)							)
																								c[i] += 1
																								lowerCamelCase__   =0
																		else:
																								lowerCamelCase__   =0
																								i += 1

						generate(len(__lowerCAmelCase							)  ,       __lowerCAmelCase							)
						return res


if __name__ == "__main__":
	a				=input('Enter numbers separated by a comma:\n').strip()
	a				=[int(item) for item in user_input.split(',')]
	print(heaps(arr))


