import heapq





def  _lowerCamelCase					(   a_				: Optional[Any]):
   lowerCamelCase						:str						  =     []

   # 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
   lowerCamelCase						:Tuple						  =     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
      lowerCamelCase						:Any						  =     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]:
            lowerCamelCase						:Optional[Any]						  =     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()

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




import operator as op





def  _lowerCamelCase					(   a_				: Tuple):
			lowerCamelCase						:int						  =     []
			lowerCamelCase						:List[str]						  =     lambda a_						,			a_: int(x / y)  # noqa: E731 integer division operation
			lowerCamelCase						:Optional[int]						  =     {
			    '''^''': op.pow,
			    '''*''': op.mul,
			    '''/''': div,
			    '''+''': op.add,
			    '''-''': op.sub,
			}  # operators & their respective operation

			# print table header
			print('''Symbol'''.center(8)						,			'''Action'''.center(12)						,			'''Stack'''						,			sep=''' | ''')
			print('''-''' * (30 + len(a_)))

			for x in post_fix:
						if x.isdigit():  # if x in digit
									stack.append(a_)  # append x to stack
									# output in tabular format
									print(x.rjust(8)						,			('''push(''' + x + ''')''').ljust(12)						,			''','''.join(a_)						,			sep=''' | ''')
						else:
									lowerCamelCase						:Optional[Any]						  =     stack.pop()  # pop stack
									# output in tabular format
									print(''''''.rjust(8)						,			('''pop(''' + b + ''')''').ljust(12)						,			''','''.join(a_)						,			sep=''' | ''')

									lowerCamelCase						:str						  =     stack.pop()  # pop stack
									# output in tabular format
									print(''''''.rjust(8)						,			('''pop(''' + a + ''')''').ljust(12)						,			''','''.join(a_)						,			sep=''' | ''')

									stack.append(
									    str(opr[x](int(a_)						,			int(a_))))  # evaluate the 2 values popped from stack & push result to stack
									# output in tabular format
									print(
									    x.rjust(8)						,			('''push(''' + a + x + b + ''')''').ljust(12)						,			''','''.join(a_)						,			sep=''' | '''						,			)

			return int(stack[0])


if __name__ == "__main__":
			A__           =							input("""\n\nEnter a Postfix Equation (space separated) = """).split(""" """)
			print("""\n\tResult = """, solve(Postfix))



