






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}')














import os

# Precomputes a list of the 100 first triangular numbers
__UpperCAmelCase								=						[int(0.5 * n * (n + 1)) for n in range(1, 101)]




def      lowercase__      (     ):


					'''simple docstring'''


					UpperCAmelCase_    :      Any            =						os.path.dirname(os.path.realpath(__snake_case  )  )
					UpperCAmelCase_    :      Optional[Any]            =						os.path.join(__snake_case     ,       'words.txt'  )

					UpperCAmelCase_    :      Union[str, Any]            =						''
					with open(__snake_case  ) as f:
										UpperCAmelCase_    :      List[Any]            =						f.readline()

					UpperCAmelCase_    :      Optional[int]            =						[word.strip('"'  ) for word in words.strip('\r\n'  ).split(','  )]
					UpperCAmelCase_    :      Optional[int]            =						[
					    word
					    for word in [sum(ord(__snake_case  ) - 64 for x in word  ) for word in words]
					    if word in TRIANGULAR_NUMBERS
					]
					return len(__snake_case  )


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






