def 			__SCREAMING_SNAKE_CASE						(      __UpperCamelCase					: str				,  __UpperCamelCase					: List[Any]			)							->      Optional[int]:







  """simple docstring"""





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






def 			__SCREAMING_SNAKE_CASE						(      __UpperCamelCase					: Union[str, Any]				,  __UpperCamelCase					: int			)							->      Optional[Any]:







  """simple docstring"""





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

from __future__ import annotations



def 			__SCREAMING_SNAKE_CASE						(      __UpperCamelCase					: list			)							->      float:







  """simple docstring"""





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


if __name__ == "__main__":
   import doctest

   doctest.testmod()
