





'''simple docstring'''







def    __UpperCamelCase	(	a    : int = 1000     ) ->int:
 snake_case				=			2**power
 snake_case				=			str(a     )
 snake_case				=			list(a     )
 snake_case				=			0

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

 return sum_of_num


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








'''simple docstring'''







from __future__ import annotations

from collections.abc import Iterator
class 			_lowercase						:







     def __init__( self    ,   A__    ) ->	None:
      snake_case				=			value
      snake_case				=			None
      snake_case				=			None




class 			_lowercase						:







     def __init__( self    ,   A__    ) ->	None:
      snake_case				=			tree







     def     UpperCamelCase			( self    ,   A__    ) ->	int:
      if node is None:
       return 0
      return node.value + (
          self.depth_first_search(node.left    ) + self.depth_first_search(node.right    )
      )







     def __iter__( self    ) ->	Iterator[int]:
      yield self.depth_first_search(self.tree    )


if __name__ == "__main__":
   import doctest

   doctest.testmod()

