






'''simple docstring'''




import math







def       __UpperCAmelCase						(  lowerCamelCase_     ,      lowerCamelCase_)							->     int:
		UpperCamelCase__				:					Optional[Any]					=					len(SCREAMING_SNAKE_CASE_)
		UpperCamelCase__				:					Union[str, Any]					=					int(math.floor(math.sqrt(SCREAMING_SNAKE_CASE_)))
		UpperCamelCase__				:					Union[str, Any]					=					0
		while arr[min(SCREAMING_SNAKE_CASE_     ,      SCREAMING_SNAKE_CASE_) - 1] < x:
				UpperCamelCase__				:					Any					=					step
				step += int(math.floor(math.sqrt(SCREAMING_SNAKE_CASE_)))
				if prev >= n:
						return -1

		while arr[prev] < x:
				UpperCamelCase__				:					str					=					prev + 1
				if prev == min(SCREAMING_SNAKE_CASE_     ,      SCREAMING_SNAKE_CASE_):
						return -1
		if arr[prev] == x:
				return prev
		return -1


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












'''simple docstring'''




def       __UpperCAmelCase						(  lowerCamelCase_     ,      lowerCamelCase_)							->     list[str]:
		return [sentence[i : i + ngram_size] for i in range(len(lowerCamelCase_) - ngram_size + 1)]


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

		testmod()




