
"""simple docstring"""






lowerCamelCase__ :       Optional[int]						     =			{0: [2, 3], 1: [0], 2: [1], 3: [4], 4: []}

lowerCamelCase__ :       Dict						     =			{0: [1, 2, 3], 1: [2], 2: [0], 3: [4], 4: [5], 5: [3]}





def __A						(   a_ :							dict[int, list[int]]		,		a_ :							int		,		a_ :							list[bool]     )->							list[int]:




		'''simple docstring'''






		SCREAMING_SNAKE_CASE       :     Any				= True
		SCREAMING_SNAKE_CASE       :     Dict				= []

		for neighbour in graph[vert]:
				if not visited[neighbour]:
						order += topology_sort(a_		,		a_		,		a_     )

		order.append(a_     )

		return order





def __A						(   a_ :							dict[int, list[int]]		,		a_ :							int		,		a_ :							list[bool]     )->							list[int]:




		'''simple docstring'''






		SCREAMING_SNAKE_CASE       :     Dict				= True
		SCREAMING_SNAKE_CASE       :     str				= [vert]

		for neighbour in reversed_graph[vert]:
				if not visited[neighbour]:
						component += find_components(a_		,		a_		,		a_     )

		return component





def __A						(   a_ :							dict[int, list[int]]     )->							list[list[int]]:




		'''simple docstring'''






		SCREAMING_SNAKE_CASE       :     int				= len(a_     ) * [False]
		SCREAMING_SNAKE_CASE       :     dict[int, list[int]]				= {vert: [] for vert in range(len(a_     )     )}

		for vert, neighbours in graph.items():
				for neighbour in neighbours:
						reversed_graph[neighbour].append(a_     )

		SCREAMING_SNAKE_CASE       :     Optional[Any]				= []
		for i, was_visited in enumerate(a_     ):
				if not was_visited:
						order += topology_sort(a_		,		a_		,		a_     )

		SCREAMING_SNAKE_CASE       :     Dict				= []
		SCREAMING_SNAKE_CASE       :     Union[str, Any]				= len(a_     ) * [False]

		for i in range(len(a_     )     ):
				SCREAMING_SNAKE_CASE       :     Union[str, Any]				= order[len(a_     ) - i - 1]
				if not visited[vert]:
						SCREAMING_SNAKE_CASE       :     str				= find_components(a_		,		a_		,		a_     )
						components_list.append(a_     )

		return components_list







"""simple docstring"""






import math





def __A						(   a_ :							list		,		a_ :							int     )->							int:




		'''simple docstring'''






		SCREAMING_SNAKE_CASE       :     Optional[int]				= len(a_     )
		SCREAMING_SNAKE_CASE       :     Optional[Any]				= int(math.floor(math.sqrt(a_     )     )     )
		SCREAMING_SNAKE_CASE       :     List[str]				= 0
		while arr[min(a_		,		a_     ) - 1] < x:
				SCREAMING_SNAKE_CASE       :     Optional[Any]				= step
				step += int(math.floor(math.sqrt(a_     )     )     )
				if prev >= n:
						return -1

		while arr[prev] < x:
				SCREAMING_SNAKE_CASE       :     Any				= prev + 1
				if prev == min(a_		,		a_     ):
						return -1
		if arr[prev] == x:
				return prev
		return -1


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





