


def     UpperCamelCase_(			_A				:list					)->						bool:





			if not isinstance(SCREAMING_SNAKE_CASE_			,       SCREAMING_SNAKE_CASE_					):
						raise ValueError("Input series is not valid, valid series - [1, 2/3, 2]"					)
			if len(SCREAMING_SNAKE_CASE_					) == 0:
						raise ValueError("Input list must be a non empty list"					)
			if len(SCREAMING_SNAKE_CASE_					) == 1 and series[0] != 0:
						return True
			UpperCamelCase__   =    []
			UpperCamelCase__   =    len(SCREAMING_SNAKE_CASE_					)
			for i in range(0			,       SCREAMING_SNAKE_CASE_					):
						if series[i] == 0:
									raise ValueError("Input series cannot have 0 as an element"					)
						rec_series.append(1 / series[i]					)
			UpperCamelCase__   =    rec_series[1] - rec_series[0]
			for index in range(2			,       SCREAMING_SNAKE_CASE_					):
						if rec_series[index] - rec_series[index - 1] != common_diff:
									return False
			return True
def     UpperCamelCase_(			_A				:list					)->						float:





			if not isinstance(SCREAMING_SNAKE_CASE_			,       SCREAMING_SNAKE_CASE_					):
						raise ValueError("Input series is not valid, valid series - [2, 4, 6]"					)
			if len(SCREAMING_SNAKE_CASE_					) == 0:
						raise ValueError("Input list must be a non empty list"					)
			UpperCamelCase__   =    0
			for val in series:
						answer += 1 / val
			return len(SCREAMING_SNAKE_CASE_					) / answer


if __name__ == "__main__":
						import doctest

						doctest.testmod()






from __future__ import annotations
def     UpperCamelCase_(			_A				:list					)->						int | float:
			UpperCamelCase__   =    sorted(_A					)
			UpperCamelCase__   =    len(_A					)
			UpperCamelCase__   =    length >> 1
			return (
			    (sorted_list[mid_index] + sorted_list[mid_index - 1]) / 2
			    if length % 2 == 0
			    else sorted_list[mid_index]
			)
def     UpperCamelCase_(			)->						List[Any]:
			import doctest

			doctest.testmod()


if __name__ == "__main__":
						main()


