






from statistics import mean, stdev







def      snake_case		(							UpperCAmelCase	:       list,						UpperCAmelCase	:       int = 3   ):
				A	 =      min(UpperCAmelCase   )
				A	 =      max(UpperCAmelCase   )
				# normalize data
				return [round((x - x_min) / (x_max - x_min),						UpperCAmelCase   ) for x in data]







def      snake_case		(							UpperCAmelCase	:       list,						UpperCAmelCase	:       int = 3   ):
				A	 =      mean(UpperCAmelCase   )
				A	 =      stdev(UpperCAmelCase   )
				# standardize data
				return [round((x - mu) / (sigma),						UpperCAmelCase   ) for x in data]













import math







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

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


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





