



'''simple docstring'''


def  UpperCAmelCase_       (		lowercase__       ):


     '''simple docstring'''







     a_       		=0
     while num > 0:
          digit_sum += num % 1_0
          num //= 1_0
     return digit_sum




def  UpperCAmelCase_       (		lowercase__ = 1_0_0       ):


     '''simple docstring'''







     a_       		=1
     a_       		=2

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

     return sum_digits(__UpperCAmelCase       )


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







'''simple docstring'''


import os
from math import logaa






def  UpperCAmelCase_       (		lowercase__ = "base_exp.txt"       ):


     '''simple docstring'''







     a_       		=0
     a_       		=0
     for i, line in enumerate(open(os.path.join(os.path.dirname(lowercase__       )       ,	lowercase__       )       )       ):
          a_		,						a_       		=list(map(lowercase__       ,	line.split(","       )       )       )
          if x * logaa(lowercase__       ) > largest:
               a_       		=x * logaa(lowercase__       )
               a_       		=i + 1
     return result


if __name__ == "__main__":
  print(solution())


