A7935 | Two Paths

注意这题要加上这个：

```
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
```

Once archaeologists found $m$ mysterious papers, each of which had a pair of integers written on them. Ancient people were known to like writing down the indexes of the roads they walked along, as « $a$ $b$ » or « $b$ $a$ », where $a,b$ are the indexes of two different cities joint by the road . It is also known that the mysterious papers are pages of two travel journals (those days a new journal was written for every new journey).

During one journey the traveler could walk along one and the same road several times in one or several directions but in that case he wrote a new entry for each time in his journal. Besides, the archaeologists think that the direction the traveler took on a road had no effect upon the entry: the entry that looks like « $a$ $b$ » could refer to the road from $a$ to $b$ as well as to the road from $b$ to $a$ .

The archaeologists want to put the pages in the right order and reconstruct the two travel paths but unfortunately, they are bad at programming. That’s where you come in. Go help them!

The first input line contains integer $m$ ( $1<=m<=10000$ ). Each of the following $m$ lines describes one paper. Each description consists of two integers $a,b$ ( $1<=a,b<=10000$ , $a≠b$ ).