




import math




def 						SCREAMING_SNAKE_CASE__ (   lowercase						,lowercase					)  ->       int:
   snake_case				:    Optional[int]           =	len(lowercase					)
   snake_case				:    Dict           =	int(math.floor(math.sqrt(lowercase					)					)					)
   snake_case				:    Optional[Any]           =	0
   while arr[min(lowercase						,lowercase					) - 1] < x:
      snake_case				:    Any           =	step
      step += int(math.floor(math.sqrt(lowercase					)					)					)
      if prev >= n:
         return -1

   while arr[prev] < x:
      snake_case				:    str           =	prev + 1
      if prev == min(lowercase						,lowercase					):
         return -1
   if arr[prev] == x:
      return prev
   return -1


if __name__ == "__main__":
       lowerCamelCase	:	Optional[int]				=   input('Enter numbers separated by a comma:\n').strip()
       lowerCamelCase	:	List[Any]				=   [int(item) for item in user_input.split(',')]
       lowerCamelCase	:	int				=   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}""")











from math import pow




def 						SCREAMING_SNAKE_CASE__ (   lowercase						,lowercase						,lowercase						,lowercase						,lowercase						,)  ->       tuple[int, int]:
   if current_sum == needed_sum:
      # If the sum of the powers is equal to needed_sum, then we have a solution.
      solutions_count += 1
      return current_sum, solutions_count

   snake_case				:    Union[str, Any]           =	int(pow(lowercase						,lowercase					)					)
   if current_sum + i_to_n <= needed_sum:
      # If the sum of the powers is less than needed_sum, then continue adding powers.
      current_sum += i_to_n
      snake_case     , snake_case				:    List[Any]           =	backtrack(
          lowercase						,lowercase						,current_number + 1						,lowercase						,lowercase					)
      current_sum -= i_to_n
   if i_to_n < needed_sum:
      # If the power of i is less than needed_sum, then try with the next power.
      snake_case     , snake_case				:    str           =	backtrack(
          lowercase						,lowercase						,current_number + 1						,lowercase						,lowercase					)
   return current_sum, solutions_count




def 						SCREAMING_SNAKE_CASE__ (   lowercase						,lowercase					)  ->       int:
   if not (1 <= needed_sum <= 1000 and 2 <= power <= 10):
      raise ValueError(
          """Invalid input\n"""
          """needed_sum must be between 1 and 1000, power between 2 and 10."""					)

   return backtrack(lowercase						,lowercase						,1						,0						,0					)[1]  # Return the solutions_count


if __name__ == "__main__":
       import doctest

       doctest.testmod()





