






def    SCREAMING_SNAKE_CASE_							(							__magic_name__					:  int					)		->			bool:






	"""simple docstring"""



	UpperCamelCase     :Optional[Any]          =	(1 + 24 * n) ** 0.5
	return ((1 + root) / 6) % 1 == 0

def    SCREAMING_SNAKE_CASE_							(							__magic_name__					:  int = 5000					)		->			int:






	"""simple docstring"""



	UpperCamelCase     :Optional[int]          =	[(i * (3 * i - 1)) // 2 for i in range(1	,			__magic_name__					)]
	for i, pentagonal_i in enumerate(__magic_name__					):
		for j in range(__magic_name__	,			len(__magic_name__					)					):
			UpperCamelCase     :List[str]          =	pentagonal_nums[j]
			UpperCamelCase     :Dict          =	pentagonal_i + pentagonal_j
			UpperCamelCase     :Optional[Any]          =	pentagonal_j - pentagonal_i
			if is_pentagonal(__magic_name__					) and is_pentagonal(__magic_name__					):
				return b

	return -1


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




from __future__ import annotations

import bisect


def        _UpperCamelCase							(      lowercase__    ,       lowercase__    ,       lowercase__ = 0    ,       lowercase__ = -1      ):
						if hi < 0:
												__SCREAMING_SNAKE_CASE						:     Union[str, Any]					=		len(lowercase__      )

						while lo < hi:
												__SCREAMING_SNAKE_CASE						:     Any					=		lo + (hi - lo) // 2
												if sorted_collection[mid] < item:
																		__SCREAMING_SNAKE_CASE						:     Union[str, Any]					=		mid + 1
												else:
																		__SCREAMING_SNAKE_CASE						:     Optional[Any]					=		mid

						return lo


def        _UpperCamelCase							(      lowercase__    ,       lowercase__    ,       lowercase__ = 0    ,       lowercase__ = -1      ):
						if hi < 0:
												__SCREAMING_SNAKE_CASE						:     List[Any]					=		len(lowercase__      )

						while lo < hi:
												__SCREAMING_SNAKE_CASE						:     Optional[int]					=		lo + (hi - lo) // 2
												if sorted_collection[mid] <= item:
																		__SCREAMING_SNAKE_CASE						:     Any					=		mid + 1
												else:
																		__SCREAMING_SNAKE_CASE						:     Optional[int]					=		mid

						return lo


def        _UpperCamelCase							(      lowercase__    ,       lowercase__    ,       lowercase__ = 0    ,       lowercase__ = -1      ):
						sorted_collection.insert(bisect_left(lowercase__    ,       lowercase__    ,       lowercase__    ,       lowercase__      )    ,       lowercase__      )


def        _UpperCamelCase							(      lowercase__    ,       lowercase__    ,       lowercase__ = 0    ,       lowercase__ = -1      ):
						sorted_collection.insert(bisect_right(lowercase__    ,       lowercase__    ,       lowercase__    ,       lowercase__      )    ,       lowercase__      )


def        _UpperCamelCase							(      lowercase__    ,       lowercase__      ):
						__SCREAMING_SNAKE_CASE						:     Any					=		0
						__SCREAMING_SNAKE_CASE						:     List[Any]					=		len(lowercase__      ) - 1

						while left <= right:
												__SCREAMING_SNAKE_CASE						:     str					=		left + (right - left) // 2
												__SCREAMING_SNAKE_CASE						:     List[str]					=		sorted_collection[midpoint]
												if current_item == item:
																		return midpoint
												elif item < current_item:
																		__SCREAMING_SNAKE_CASE						:     int					=		midpoint - 1
												else:
																		__SCREAMING_SNAKE_CASE						:     Dict					=		midpoint + 1
						return None


def        _UpperCamelCase							(      lowercase__    ,       lowercase__      ):
						__SCREAMING_SNAKE_CASE						:     Union[str, Any]					=		bisect.bisect_left(lowercase__    ,       lowercase__      )
						if index != len(lowercase__      ) and sorted_collection[index] == item:
												return index
						return None


def        _UpperCamelCase							(      lowercase__    ,       lowercase__    ,       lowercase__    ,       lowercase__      ):
						if right < left:
												return None

						__SCREAMING_SNAKE_CASE						:     int					=		left + (right - left) // 2

						if sorted_collection[midpoint] == item:
												return midpoint
						elif sorted_collection[midpoint] > item:
												return binary_search_by_recursion(lowercase__    ,       lowercase__    ,       lowercase__    ,       midpoint - 1      )
						else:
												return binary_search_by_recursion(lowercase__    ,       lowercase__    ,       midpoint + 1    ,       lowercase__      )


if __name__ == "__main__":
						__lowerCAmelCase	: Dict  				=input('Enter numbers separated by comma:\n').strip()
						__lowerCAmelCase	: str  				=sorted(int(item) for item in user_input.split(','))
						__lowerCAmelCase	: Tuple  				=int(input('Enter a single number to be found in the list:\n'))
						__lowerCAmelCase	: Tuple  				=binary_search(collection, target)
						if result is None:
												print(f"""{target} was not found in {collection}.""")
						else:
												print(f"""{target} was found at position {result} in {collection}.""")
