

'''simple docstring'''






import heapq


def 						_A	(       A__ ):






 """simple docstring"""



 __lowercase				    =					[]

 # for each node and his adjacency list add them and the rank of the node to queue
 # using heapq module the queue will be filled like a Priority Queue
 # heapq works with a min priority queue, so I used -1*len(v) to build it
 for key, value in graph.items():
  # O(log(n))
  heapq.heappush(A__	,							[-1 * len(A__ ), (key, value)] )

 # chosen_vertices = set of chosen vertices
 __lowercase				    =					set()

 # while queue isn't empty and there are still edges
 #   (queue[0][0] is the rank of the node with max rank)
 while queue and queue[0][0] != 0:
  # extract vertex with max rank from queue and add it to chosen_vertices
  __lowercase				    =					heapq.heappop(A__ )[1][0]
  chosen_vertices.add(A__ )

  # Remove all arcs adjacent to argmax
  for elem in queue:
   # if v haven't adjacent node, skip
   if elem[0] == 0:
    continue
   # if argmax is reachable from elem
   # remove argmax from elem's adjacent list and update his rank
   if argmax in elem[1][1]:
    __lowercase				    =					elem[1][1].index(A__ )
    del elem[1][1][index]
    elem[0] += 1
        # re-order the queue
  heapq.heapify(A__ )
 return chosen_vertices


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 lowerCAmelCase__   		=      {0: [1, 3], 1: [0, 3], 2: [0, 3, 4], 3: [0, 1, 2], 4: [2, 3]}
 print(f'Minimum vertex cover:\n{greedy_min_vertex_cover(graph)}')





def 						_lowerCAmelCase							(     _lowerCAmelCase = 1000			)    ->						int:


						'''simple docstring'''






						__snake_case				=		2**power
						__snake_case				=		str(_lowerCAmelCase			)
						__snake_case				=		list(_lowerCAmelCase			)
						__snake_case				=		0

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

						return sum_of_num


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





