


'''simple docstring'''






from __future__ import annotations





def      UpperCAmelCase      (		lowerCamelCase_  :list[int] ):







		'''simple docstring'''
		return len(set(lowerCamelCase_ ) ) == len(lowerCamelCase_ )


if __name__ == "__main__":
							import doctest

							doctest.testmod()



'''simple docstring'''






import math





def      UpperCAmelCase      (		lowerCamelCase_  :list				,      lowerCamelCase_  :int ):







		'''simple docstring'''
		snake_case_		:							Union[str, Any]			       =						len(lowerCamelCase_ )
		snake_case_		:							List[Any]			       =						int(math.floor(math.sqrt(lowerCamelCase_ ) ) )
		snake_case_		:							str			       =						0
		while arr[min(lowerCamelCase_				,      lowerCamelCase_ ) - 1] < x:
				snake_case_		:							Any			       =						step
				step += int(math.floor(math.sqrt(lowerCamelCase_ ) ) )
				if prev >= n:
						return -1

		while arr[prev] < x:
				snake_case_		:							Optional[Any]			       =						prev + 1
				if prev == min(lowerCamelCase_				,      lowerCamelCase_ ):
						return -1
		if arr[prev] == x:
				return prev
		return -1


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