




def 		a_							( __lowerCAmelCase				):
  lowerCAmelCase__										=      0
  while num > 0:
    digit_sum += num % 10
    num //= 10
  return digit_sum
def 		a_							( __lowerCAmelCase = 1_00				):
  lowerCAmelCase__										=      1
  lowerCAmelCase__										=      2

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

  return sum_digits(__lowerCAmelCase				)


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







from __future__ import annotations
def 		a_							( __lowerCAmelCase				):
  if not nums:
    return 0
  lowerCAmelCase__										=      nums[0]
  lowerCAmelCase__										=      0
  for num in nums[1:]:
    lowerCAmelCase__				,      lowerCAmelCase__										=      (
        max_excluding + num,
        max(__lowerCAmelCase   , __lowerCAmelCase				),
    )
  return max(__lowerCAmelCase   , __lowerCAmelCase				)


if __name__ == "__main__":
      import doctest

      doctest.testmod()

