


'''simple docstring'''






def    _snake_case  (	A			)		->       float:
							if not nums:  # Makes sure that the list is not empty
														raise ValueError('''List is empty'''			)

							lowerCAmelCase__			  =      sum(A			) / len(A			)  # Calculate the average
							return sum(abs(x - average			) for x in nums			) / len(A			)


if __name__ == "__main__":
		import doctest

		doctest.testmod()



'''simple docstring'''






def    _snake_case  (	A					,       A			)		->       int:
							return x if y == 0 else greatest_common_divisor(A					,       x % y			)


def    _snake_case  (	A					,       A			)		->       int:
							return (x * y) // greatest_common_divisor(A					,       A			)


def    _snake_case  (	A = 20			)		->       int:
							lowerCAmelCase__			  =      1
							for i in range(1					,       n + 1			):
														lowerCAmelCase__			  =      lcm(A					,       A			)
							return g


if __name__ == "__main__":
		print(f"""{solution() = }""")