
import math




def 							a		(				snake_case__:   list		,  snake_case__:   int   ):


				'''simple docstring'''
				lowercase_	    =   len(snake_case__   )
				lowercase_	    =   int(math.floor(math.sqrt(snake_case__   )   )   )
				lowercase_	    =   0
				while arr[min(snake_case__		,  snake_case__   ) - 1] < x:
								lowercase_	    =   step
								step += int(math.floor(math.sqrt(snake_case__   )   )   )
								if prev >= n:
												return -1

				while arr[prev] < x:
								lowercase_	    =   prev + 1
								if prev == min(snake_case__		,  snake_case__   ):
												return -1
				if arr[prev] == x:
								return prev
				return -1


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






def  __lowerCamelCase					( _lowercase			)       ->      str:
     return "".join(chr(ord(_lowercase			) - 32			) if 'a' <= char <= 'z' else char for char in word			)


if __name__ == "__main__":
 from doctest import testmod

 testmod()


