


"""simple docstring"""





import math


def    _snake_case  (  _snake_case :	list       ,      _snake_case :	int	):
      lowerCAmelCase    :		Any				=      len(_snake_case	)
      lowerCAmelCase    :		Dict				=      int(math.floor(math.sqrt(_snake_case	)	)	)
      lowerCAmelCase    :		Union[str, Any]				=      0
      while arr[min(_snake_case       ,      _snake_case	) - 1] < x:
            lowerCAmelCase    :		List[str]				=      step
            step += int(math.floor(math.sqrt(_snake_case	)	)	)
            if prev >= n:
                  return -1

      while arr[prev] < x:
            lowerCAmelCase    :		List[Any]				=      prev + 1
            if prev == min(_snake_case       ,      _snake_case	):
                  return -1
      if arr[prev] == x:
            return prev
      return -1


if __name__ == "__main__":
 snake_case__						:   Dict			 = input('''Enter numbers separated by a comma:\n''').strip()
 snake_case__						:   Tuple			 = [int(item) for item in user_input.split(''',''')]
 snake_case__						:   str			 = int(input('''Enter the number to be searched:\n'''))
 snake_case__						:   Tuple			 = jump_search(arr, x)
 if res == -1:
  print('''Number not found!''')
 else:
  print(f"""Number {x} is at index {res}""")






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}.""")
