






import math




def      lowercase__      (     __snake_case    :							list     ,       __snake_case    :							int  ):


					'''simple docstring'''


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

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


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













"""simple docstring"""
def      __lowerCamelCase   (							a_     :		Union[str, Any]							)			->      Optional[int]:
      __SCREAMING_SNAKE_CASE   :List[str]						=  1
      __SCREAMING_SNAKE_CASE   :Dict						=  2
      while i * i <= n:
            __SCREAMING_SNAKE_CASE   :Tuple						=  0
            while n % i == 0:
                  n //= i
                  multiplicity += 1
            n_divisors *= multiplicity + 1
            i += 1
      if n > 1:
            n_divisors *= 2
      return n_divisors



def      __lowerCamelCase   (							)			->      int:
      __SCREAMING_SNAKE_CASE   :Dict						=  1
      __SCREAMING_SNAKE_CASE   :Dict						=  1

      while True:
            i += 1
            t_num += i

            if count_divisors(a_							) > 5_00:
                  break

      return t_num


if __name__ == "__main__":
  print(solution())