



'''simple docstring'''



def   __lowerCAmelCase					(							lowerCamelCase   :						int				,		lowerCamelCase   :						int					):






	'''simple docstring'''




	while a != 0:
		__lowerCAmelCase							,       __lowerCAmelCase												=  b % a, a
	return b




def   __lowerCAmelCase					(							lowerCamelCase   :						int				,		lowerCamelCase   :						int					):






	'''simple docstring'''




	if gcd(lowerCamelCase				,		lowerCamelCase					) != 1:
		__lowerCAmelCase												=  f'''mod inverse of {a!r} and {m!r} does not exist'''
		raise ValueError(lowerCamelCase					)
	__lowerCAmelCase							,       __lowerCAmelCase							,       __lowerCAmelCase												=  1, 0, a
	__lowerCAmelCase							,       __lowerCAmelCase							,       __lowerCAmelCase												=  0, 1, m
	while va != 0:
		__lowerCAmelCase												=  ua // va
		__lowerCAmelCase							,       __lowerCAmelCase							,       __lowerCAmelCase							,       __lowerCAmelCase							,       __lowerCAmelCase							,       __lowerCAmelCase												=  (ua - q * va), (ua - q * va), (ua - q * va), va, va, va
	return ua % m




'''simple docstring'''



from __future__ import annotations



def   __lowerCAmelCase					(							lowerCamelCase   :						list					):






	'''simple docstring'''




	if not nums:
		raise ValueError("List is empty"					)
	return sum(lowerCamelCase					) / len(lowerCamelCase					)


if __name__ == "__main__":
	import doctest

	doctest.testmod()