
def 		UpperCamelCase						(   lowercase_ )		->						int:


  '''simple docstring'''






  lowercase__	: Optional[int]     		=   0
  while num > 0:
    digit_sum += num % 10
    num //= 10
  return digit_sum

def 		UpperCamelCase						(   lowercase_ = 1_00 )		->						int:


  '''simple docstring'''






  lowercase__	: List[Any]     		=   1
  lowercase__	: str     		=   2

  for i in range(2			,			max_n + 1 ):
    lowercase__	: Optional[Any]     		=   pre_numerator
    lowercase__	: Optional[Any]     		=   2 * i // 3 if i % 3 == 0 else 1
    lowercase__	: Any     		=   cur_numerator
    lowercase__	: Optional[Any]     		=   e_cont * pre_numerator + temp

  return sum_digits(lowercase_ )


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








def 		UpperCamelCase						(   lowercase_ )		->						float:


  '''simple docstring'''






  if not nums:  # Makes sure that the list is not empty
    raise ValueError("""List is empty""" )

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


if __name__ == "__main__":
     import doctest

     doctest.testmod()






