


'''simple docstring'''


from __future__ import annotations






def        __lowerCAmelCase       (__lowerCAmelCase					,       __lowerCAmelCase      ):
		if len(__lowerCAmelCase      ) == 0:
				return False
		_UpperCAmelCase						:				List[str]	    =					len(__lowerCAmelCase      ) // 2
		if a_list[midpoint] == item:
				return True
		if item < a_list[midpoint]:
				return binary_search(a_list[:midpoint]					,       __lowerCAmelCase      )
		else:
				return binary_search(a_list[midpoint + 1 :]					,       __lowerCAmelCase      )


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







'''simple docstring'''


import math






def        __lowerCAmelCase       (__lowerCAmelCase      ):
		return math.sqrt(__lowerCAmelCase      ) * math.sqrt(__lowerCAmelCase      ) == num






def        __lowerCAmelCase       (__lowerCAmelCase      ):
		_UpperCAmelCase						:				int	    =					0
		_UpperCAmelCase						:				Tuple	    =					n
		while left <= right:
				_UpperCAmelCase						:				int	    =					(left + right) // 2
				if mid**2 == n:
						return True
				elif mid**2 > n:
						_UpperCAmelCase						:				str	    =					mid - 1
				else:
						_UpperCAmelCase						:				List[str]	    =					mid + 1
		return False


if __name__ == "__main__":
						import doctest

						doctest.testmod()



