






def     snake_case   (UpperCAmelCase__ = 1_0_0_0    )			->							int:
  UpperCamelCase_:   Dict        =							2**power
  UpperCamelCase_:   List[Any]        =							str(UpperCAmelCase__    )
  UpperCamelCase_:   int        =							list(UpperCAmelCase__    )
  UpperCamelCase_:   Tuple        =							0

  for i in list_num:
    sum_of_num += int(UpperCAmelCase__    )

  return sum_of_num


if __name__ == "__main__":
   A_						:						Optional[Any]						      =					int(input('Enter the power of 2: ').strip())
   print('2 ^ ', power, ' = ', 2**power)
   A_						:						Any						      =					solution(power)
   print('Sum of the digits is: ', result)





'''simple docstring'''







def 						_A      ( UpperCAmelCase						):






   '''simple docstring'''







   A__       =     0
   while num > 0:
      digit_sum += num % 10
      num //= 10
   return digit_sum







def 						_A      ( UpperCAmelCase = 100						):






   '''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() = }''')


