Algorithm


C. Mail Stamps
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

One day Bob got a letter in an envelope. Bob knows that when Berland's post officers send a letter directly from city «A» to city «B», they stamp it with «A B», or «B A». Unfortunately, often it is impossible to send a letter directly from the city of the sender to the city of the receiver, that's why the letter is sent via some intermediate cities. Post officers never send a letter in such a way that the route of this letter contains some city more than once. Bob is sure that the post officers stamp the letters accurately.

There are n stamps on the envelope of Bob's letter. He understands that the possible routes of this letter are only two. But the stamps are numerous, and Bob can't determine himself none of these routes. That's why he asks you to help him. Find one of the possible routes of the letter.

Input

The first line contains integer n (1 ≤ n ≤ 105) — amount of mail stamps on the envelope. Then there follow n lines with two integers each — description of the stamps. Each stamp is described with indexes of the cities between which a letter is sent. The indexes of cities are integers from 1 to 109. Indexes of all the cities are different. Every time the letter is sent from one city to another, exactly one stamp is put on the envelope. It is guaranteed that the given stamps correspond to some valid route from some city to some other city.

Output

Output n + 1 numbers — indexes of cities in one of the two possible routes of the letter.

Examples
input
Copy
2
1 100
100 2
output
Copy
2 100 1 
input
Copy
3
3 1
100 2
3 2
output
Copy
100 2 3 1 



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>

int main(){

    long n; scanf("%ld", &n);
    std::map<long, std::vector<long> > r;
    std::map<long, int> num;

    for(long p = 0; p < n; p++){
        long x, y; scanf("%ld %ld", &x, &y);
        if(r.count(x) == 0){r[x] = std::vector<long>(1, y);}
        else{r[x].push_back(y);}

        if(r.count(y) == 0){r[y] = std::vector<long>(1, x);}
        else{r[y].push_back(x);}

        if(num.count(x) == 0){num[x] = 1;} else{++num[x];}
        if(num.count(y) == 0){num[y] = 1;} else{++num[y];}
    }

    long city(-1);
    for(std::map<long, int>::iterator it = num.begin(); it != num.end(); it++){if(it->second == 1){city = it->first; break;}}

    printf("%ld ", city);
    std::set<long> been; been.insert(city);
    for(long p = 0; p < n; p++){
        std::vector < long> v = r[city];
        for(long q = 0; q < v.size(); q++){
            if(been.count(v[q]) > 0){continue;}
            else{city = v[q]; printf("%ld ", city); been.insert(city); break;}
        }
    }

    puts("");

    return 0;
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
2
1 100
100 2

Output

x
+
cmd
2 100 1
Advertisements

Demonstration


Codeforces Solution-C. Mail Stamps-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+