

from __future__ import annotations
def      _lowerCAmelCase(	__A			):
  UpperCAmelCase					      =  2
  UpperCAmelCase					      =  []
  while i * i <= n:
    if n % i:
      i += 1
    else:
      n //= i
      factors.append(__snake_case			)
  if n > 1:
    factors.append(__snake_case			)
  return factors


if __name__ == "__main__":
      import doctest

      doctest.testmod()






def      _lowerCAmelCase(	__A			):
  UpperCAmelCase					      =  0
  while num > 0:
    digit_sum += num % 10
    num //= 10
  return digit_sum
def      _lowerCAmelCase(	__A = 100			):
  UpperCAmelCase					      =  1
  UpperCAmelCase					      =  2

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

  return sum_digits(__A			)


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



