Union of Doubly Linked Lists CodeForces

Doubly linked list is one of the fundamental data structures. A doubly linked list is a sequence of elements, each containing information about the previous and the next elements of the list. In this problem all lists have linear structure. I.e. each element except the first has exactly one previous element, each element except the last has exactly one next element. The list is not closed in a cycle.

In this problem you are given n memory cells forming one or more doubly linked lists. Each cell contains information about element from some list. Memory cells are numbered from 1 to n.

For each cell i you are given two values:

• l_i — cell containing previous element for the element in the cell i;
• r_i — cell containing next element for the element in the cell i.

If cell i contains information about the element which has no previous element then l_i = 0. Similarly, if cell i contains information about the element which has no next element then r_i = 0.

Three lists are shown on the picture.

For example, for the picture above the values of l and r are the following: l₁ = 4, r₁ = 7; l₂ = 5, r₂ = 0; l₃ = 0, r₃ = 0; l₄ = 6, r₄ = 1; l₅ = 0, r₅ = 2; l₆ = 0, r₆ = 4; l₇ = 1, r₇ = 0.

Your task is to unite all given lists in a single list, joining them to each other in any order. In particular, if the input data already contains a single list, then there is no need to perform any actions. Print the resulting list in the form of values l_i, r_i.

Any other action, other than joining the beginning of one list to the end of another, can not be performed.

Input

The first line contains a single integer n (1 ≤ n ≤ 100) — the number of memory cells where the doubly linked lists are located.

Each of the following n lines contains two integers l_i, r_i (0 ≤ l_i, r_i ≤ n) — the cells of the previous and the next element of list for cell i. Value l_i = 0 if element in cell i has no previous element in its list. Value r_i = 0 if element in cell i has no next element in its list.

It is guaranteed that the input contains the correct description of a single or more doubly linked lists. All lists have linear structure: each element of list except the first has exactly one previous element; each element of list except the last has exactly one next element. Each memory cell contains information about one element from some list, each element of each list written in one of n given cells.

Output

Print n lines, the i-th line must contain two integers l_i and r_i — the cells of the previous and the next element of list for cell i after all lists from the input are united in a single list. If there are many solutions print any of them.

Example

Input

7
4 7
5 0
0 0
6 1
0 2
0 4
1 0

Output

4 7
5 6
0 5
6 1
3 2
2 4
1 0

题解：用head[]记录每个链表的开头，然后依次首尾相连就行，微微不好想的是寻找每个链表的末位置。（。。。。刚开始很懵啊，不知道怎么模拟，orz）

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

int n;
int l[200],r[200],head[200];

void Solve(){
    int cnt=0;
    for(int i=1;i<=n;i++) if(l[i]==0) head[++cnt]=i;
    for(int i=1;i<cnt;i++){
            int k=head[i],temp=r[head[i]];
            while(temp!=0){ k=temp; temp=r[temp]; }
            r[k]=head[i+1];
            l[head[i+1]]=k;
    }
    for(int i=1;i<=n;i++) cout<<l[i]<<" "<<r[i]<<endl;
}

int main()
{   while(cin>>n){
        for(int i=1;i<=n;i++) cin>>l[i]>>r[i];
        Solve(); 
    }
    return 0;
}