


"""simple docstring"""




class 					__lowerCAmelCase					:  # Public class to implement a graph


		'''simple docstring'''



		def __init__(  self							, _a							, _a							, _a      ):
				__a           =			row
				__a           =			col
				__a           =			graph

		def 			__UpperCAmelCase       (  self							, _a							, _a							, _a      ):
				return (
				    0 <= i < self.ROW
				    and 0 <= j < self.COL
				    and not visited[i][j]
				    and self.graph[i][j]
				)

		def 			__UpperCAmelCase       (  self							, _a							, _a							, _a      ):
				# Checking all 8 elements surrounding nth element
				__a           =			[-1, -1, -1, 0, 0, 1, 1, 1]  # Coordinate order
				__a           =			[-1, 0, 1, -1, 1, -1, 0, 1]
				__a           =			True  # Make those cells visited
				for k in range(8      ):
						if self.is_safe(i + row_nbr[k]							, j + col_nbr[k]							, _a      ):
								self.diffs(i + row_nbr[k]							, j + col_nbr[k]							, _a      )





		def 			__UpperCAmelCase       (  self      ):  # And finally, count all islands.
				__a           =			[[False for j in range(self.COL      )] for i in range(self.ROW      )]
				__a           =			0
				for i in range(self.ROW      ):
						for j in range(self.COL      ):
								if visited[i][j] is False and self.graph[i][j] == 1:
										self.diffs(_a							, _a							, _a      )
										count += 1
				return count










"""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}''')






