
import math






def 							_lowercase							(     UpperCamelCase_	,	UpperCamelCase_		)		->		int:
					'''simple docstring'''


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

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


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







import os






def 							_lowercase							(     )		->		List[str]:
					'''simple docstring'''


					with open(os.path.dirname(UpperCamelCase_		) + '/p022_names.txt'		) as file:
										SCREAMING_SNAKE_CASE__													= str(file.readlines()[0]		)
										SCREAMING_SNAKE_CASE__													= names.replace('"'	,	''		).split(','		)

					names.sort()

					SCREAMING_SNAKE_CASE__													= 0
					SCREAMING_SNAKE_CASE__													= 0

					for i, name in enumerate(UpperCamelCase_		):
										for letter in name:
															name_score += ord(UpperCamelCase_		) - 64

										total_score += (i + 1) * name_score
										SCREAMING_SNAKE_CASE__													= 0
					return total_score


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





