


"""simple docstring"""
from __future__ import annotations







def 						_a				(       _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				)    ->				bool:
							if len(_SCREAMING_SNAKE_CASE				) == 0:
														return False
							snake_case_           =		len(_SCREAMING_SNAKE_CASE				) // 2
							if a_list[midpoint] == item:
														return True
							if item < a_list[midpoint]:
														return binary_search(a_list[:midpoint]				, _SCREAMING_SNAKE_CASE				)
							else:
														return binary_search(a_list[midpoint + 1 :]				, _SCREAMING_SNAKE_CASE				)


if __name__ == "__main__":
				__SCREAMING_SNAKE_CASE							:    List[str]		=    input('Enter numbers separated by comma:\n').strip()
				__SCREAMING_SNAKE_CASE							:    Tuple		=    [int(item.strip()) for item in user_input.split(',')]
				__SCREAMING_SNAKE_CASE							:    Union[str, Any]		=    int(input('Enter the number to be found in the list:\n').strip())
				__SCREAMING_SNAKE_CASE							:    int		=    '' if binary_search(sequence, target) else 'not '
				print(f"""{target} was {not_str}found in {sequence}""")







"""simple docstring"""
def 						_a				(      _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				)    ->				int:
							if index == number_of_items:
														return 0
							snake_case_           =		0
							snake_case_           =		0
							snake_case_           =		knapsack(_SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				, index + 1				)
							if weights[index] <= max_weight:
														snake_case_           =		values[index] + knapsack(
														    _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				, max_weight - weights[index]				, index + 1				)
							return max(_SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				)


if __name__ == "__main__":
				import doctest

				doctest.testmod()



