





class 		SCREAMING_SNAKE_CASE__    :


      def __init__(self	:				Tuple				):





         """simple docstring"""



         __snake_case								=       {}


      def        a			(self	:				Union[str, Any]				):





         """simple docstring"""



         print(self.vertex				)
         for i in self.vertex:
            print(lowerCAmelCase__    ,      ''' -> '''    ,      ''' -> '''.join([str(lowerCAmelCase__				) for j in self.vertex[i]]				)				)


      def        a			(self	:				Dict    ,      a__	:				int    ,      a__	:				int				):





         """simple docstring"""



         if from_vertex in self.vertex:
            self.vertex[from_vertex].append(lowerCAmelCase__				)
         else:
            # else make a new vertex
            __snake_case								=       [to_vertex]


      def        a			(self	:				Any				):





         """simple docstring"""



         __snake_case								=       [False] * len(self.vertex				)

         # call the recursive helper function
         for i in range(len(self.vertex				)				):
            if not visited[i]:
               self.dfs_recursive(lowerCAmelCase__    ,      lowerCAmelCase__				)


      def        a			(self	:				str    ,      a__	:				int    ,      a__	:				list				):





         """simple docstring"""



         __snake_case								=       True

         print(lowerCAmelCase__    ,      end=''' '''				)

         # Recur for all the vertices that are adjacent to this node
         for i in self.vertex:
            if not visited[i]:
               self.dfs_recursive(lowerCAmelCase__    ,      lowerCAmelCase__				)


if __name__ == "__main__":
    snake_case_           =      Graph()
    g.add_edge(0, 1)
    g.add_edge(0, 2)
    g.add_edge(1, 2)
    g.add_edge(2, 0)
    g.add_edge(2, 3)
    g.add_edge(3, 3)

    g.print_graph()
    print('DFS:')
    g.dfs()

    # OUTPUT:
    # 0  ->  1 -> 2
    # 1  ->  2
    # 2  ->  0 -> 3
    # 3  ->  3
    # DFS:
    #  0 1 2 3










def lowerCamelCase__   (							snake_case_     :  int = 1000	)				->    int:
   __snake_case								=       2**power
   __snake_case								=       str(snake_case_	)
   __snake_case								=       list(snake_case_	)
   __snake_case								=       0

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

   return sum_of_num


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

