
'''simple docstring'''






from __future__ import annotations





def    UpperCAmelCase							(  UpperCAmelCase__							:							list[int]):
				lowerCamelCase					:			int									= len(UpperCAmelCase__) // 2

				# choose the middle 3 elements
				lowerCamelCase					:			List[str]									= lst[m - 1 : m + 2]

				# if middle element is peak
				if three[1] > three[0] and three[1] > three[2]:
								return three[1]

				# if increasing, recurse on right
				elif three[0] < three[2]:
								if len(lst[:m]) == 2:
												m -= 1
								return peak(lst[m:])

				# decreasing
				else:
								if len(lst[:m]) == 2:
												m += 1
								return peak(lst[:m])


if __name__ == "__main__":
					import doctest

					doctest.testmod()


'''simple docstring'''






def    UpperCAmelCase							(  UpperCAmelCase__							:							list[int]):
				if not nums:  # Makes sure that the list is not empty
								raise ValueError('List is empty')

				lowerCamelCase					:			int									= sum(UpperCAmelCase__) / len(UpperCAmelCase__)  # Calculate the average
				return sum(abs(x - average) for x in nums) / len(UpperCAmelCase__)


if __name__ == "__main__":
					import doctest

					doctest.testmod()
