





import math







def    __lowerCamelCase					(							__a   :Optional[Any]    ,     __a   :int    )		->				Optional[Any]:






		"""simple docstring"""

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

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


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





"""simple docstring"""





def 						_lowerCAmelCase				(				UpperCamelCase_ = 10**9				):
		__SCREAMING_SNAKE_CASE            = 1
		__SCREAMING_SNAKE_CASE            = 2

		__SCREAMING_SNAKE_CASE            = 0
		__SCREAMING_SNAKE_CASE            = 0
		__SCREAMING_SNAKE_CASE            = 0
		while perimeter <= max_perimeter:
				perimeters_sum += perimeter

				prev_value += 2 * value
				value += prev_value

				__SCREAMING_SNAKE_CASE            = 2 * value + 2 if i % 2 == 0 else 2 * value - 2
				i += 1

		return perimeters_sum


if __name__ == "__main__":
							print(F"""{solution() = }""")




