B'You are given a rooted tree with vertices numerated from 1 to n . A tree is a connected graph without cycles. A rooted tree has a special vertex named root. Ancestors of the vertex i are all vertices on the path from the root to the vertex i , except the vertex i itself. The parent of the vertex i is the nearest to the vertex i ancestor of i . Each vertex is a child of its parent. In the given tree the parent of the vertex i is the vertex p_i . For the root, the value p_i is -1 . You noticed that some vertices do not respect others. In particular, if c_i = 1 , then the vertex i does not respect any of its ancestors, and if c_i = 0 , it respects all of them. You decided to delete vertices from the tree one by one. On each step you select such a non-root vertex that it does not respect its parent and none of its children respects it. If there are several such vertices, you select the one with the smallest number. When you delete this vertex v , all children of v become connected with the parent of v . Once there are no vertices matching the criteria for deletion, you stop the process. Print the order in which you will delete the vertices. Note that this order is unique. The first line contains a single integer n ( 1 <= n <= 10^5 ) -- the number of vertices in the tree. The next n lines describe the tree: the i -th line contains two integers p_i and c_i ( 1 <= p_i <= n , 0 <= c_i <= 1 ), where p_i is the parent of the vertex i , and c_i = 0 , if the vertex i respects its parents, and c_i = 1 , if the vertex i does not respect any of its parents. The root of the tree has -1 instead of the parent index, also, c_i=0 for the root. It is guaranteed that the values p_i define a rooted tree with n vertices. In case there is at least one vertex to delete, print the'...