"""simple docstring"""







from __future__ import annotations
def 						__UpperCAmelCase       (					UpperCAmelCase_					:       int						)							->    list[int]:

	'''simple docstring'''





	__snake_case    :							Union[str, Any]   	=				[True] * limit
	__snake_case    :							Tuple   	=				False
	__snake_case    :							Union[str, Any]   	=				False
	__snake_case    :							List[str]   	=				True

	for i in range(3    ,							int(limit**0.5 + 1						)    ,							2						):
		__snake_case    :							List[str]   	=				i * 2
		while index < limit:
			__snake_case    :							List[str]   	=				False
			__snake_case    :							Union[str, Any]   	=				index + i

	__snake_case    :							str   	=				[2]

	for i in range(3    ,							UpperCAmelCase_    ,							2						):
		if is_prime[i]:
			primes.append(UpperCAmelCase_						)

	return primes
def 						__UpperCAmelCase       (					UpperCAmelCase_					:       int = 1_00_00_00						)							->    int:

	'''simple docstring'''





	__snake_case    :							Tuple   	=				prime_sieve(UpperCAmelCase_						)
	__snake_case    :							int   	=				0
	__snake_case    :							str   	=				0

	for i in range(len(UpperCAmelCase_						)						):
		for j in range(i + length    ,							len(UpperCAmelCase_						)						):
			__snake_case    :							Union[str, Any]   	=				sum(primes[i:j]						)
			if sol >= ceiling:
				break

			if sol in primes:
				__snake_case    :							List[Any]   	=				j - i
				__snake_case    :							Optional[Any]   	=				sol

	return largest


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






"""simple docstring"""







import math
def 						__UpperCAmelCase       (					UpperCAmelCase_					:       list    ,							UpperCAmelCase_					:       int						)							->    int:

	'''simple docstring'''





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

	while arr[prev] < x:
		__snake_case    :							Union[str, Any]   	=				prev + 1
		if prev == min(UpperCAmelCase_    ,							UpperCAmelCase_						):
			return -1
	if arr[prev] == x:
		return prev
	return -1


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





