




'''simple docstring'''

import math


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

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


if __name__ == "__main__":
						a       :						int								=		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}''')










def 	_lowerCAmelCase (    A__ = 50_000_000						):
      lowercase__  =	set()
      lowercase__  =	int((limit - 24) ** (1 / 2)						)

      lowercase__  =	set(range(3    ,	prime_square_limit + 1    ,	2						)						)
      primes.add(2						)
      for p in range(3    ,	prime_square_limit + 1    ,	2						):
            if p not in primes:
                  continue
            primes.difference_update(set(range(p * p    ,	prime_square_limit + 1    ,	A__						)						)						)

      for primea in primes:
            lowercase__  =	primea * primea
            for primea in primes:
                  lowercase__  =	primea * primea * primea
                  if square + cube >= limit - 16:
                        break
                  for primea in primes:
                        lowercase__  =	primea * primea * primea * primea
                        lowercase__  =	square + cube + tetr
                        if total >= limit:
                              break
                        ret.add(A__						)

      return len(A__						)


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