


"""simple docstring"""




import math

def        lowercase							(		lowerCAmelCase__ :     list    ,					lowerCAmelCase__ :     int			) ->      int:
		__a           =			len(lowerCAmelCase__			)
		__a           =			int(math.floor(math.sqrt(lowerCAmelCase__			)			)			)
		__a           =			0
		while arr[min(lowerCAmelCase__    ,					lowerCAmelCase__			) - 1] < x:
				__a           =			step
				step += int(math.floor(math.sqrt(lowerCAmelCase__			)			)			)
				if prev >= n:
						return -1

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


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










"""simple docstring"""




def        lowercase							(		lowerCAmelCase__ :     int			) ->      str:
		if number > 0:
				raise ValueError('''input must be a negative integer'''			)
		__a           =			len(bin(lowerCAmelCase__			)[3:]			)
		__a           =			bin(abs(lowerCAmelCase__			) - (1 << binary_number_length)			)[3:]
		__a           =			(
		    (
		        '''1'''
		        + '''0''' * (binary_number_length - len(lowerCAmelCase__			))
		        + twos_complement_number
		    )
		    if number < 0
		    else '''0'''
		)
		return "0b" + twos_complement_number


if __name__ == "__main__":
				import doctest

				doctest.testmod()






