#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<int, vector<int>> G;
// Input edges
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
}
// Queue and visited array
queue<int> q;
vector<bool> visited(n + 1, false);
// Insert root (1)
q.push(1);
visited[1] = true;
// BFS traversal
while (!q.empty()) {
int front = q.front();
q.pop();
cout << front << " ";
for (int child : G[front]) {
if (!visited[child]) {
visited[child] = true;
q.push(child);
}
}
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNpbmNsdWRlIDxpb3N0cmVhbT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewogICAgaW50IG47CiAgICBjaW4gPj4gbjsKCiAgICB1bm9yZGVyZWRfbWFwPGludCwgdmVjdG9yPGludD4+IEc7CgogICAgLy8gSW5wdXQgZWRnZXMKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgaW50IGEsIGI7CiAgICAgICAgY2luID4+IGEgPj4gYjsKCiAgICAgICAgR1thXS5wdXNoX2JhY2soYik7CiAgICB9CgogICAgLy8gUXVldWUgYW5kIHZpc2l0ZWQgYXJyYXkKICAgIHF1ZXVlPGludD4gcTsKICAgIHZlY3Rvcjxib29sPiB2aXNpdGVkKG4gKyAxLCBmYWxzZSk7CgogICAgLy8gSW5zZXJ0IHJvb3QgKDEpCiAgICBxLnB1c2goMSk7CiAgICB2aXNpdGVkWzFdID0gdHJ1ZTsKCiAgICAvLyBCRlMgdHJhdmVyc2FsCiAgICB3aGlsZSAoIXEuZW1wdHkoKSkgewogICAgICAgIGludCBmcm9udCA9IHEuZnJvbnQoKTsKICAgICAgICBxLnBvcCgpOwoKICAgICAgICBjb3V0IDw8IGZyb250IDw8ICIgIjsKCiAgICAgICAgZm9yIChpbnQgY2hpbGQgOiBHW2Zyb250XSkgewogICAgICAgICAgICBpZiAoIXZpc2l0ZWRbY2hpbGRdKSB7CiAgICAgICAgICAgICAgICB2aXNpdGVkW2NoaWxkXSA9IHRydWU7CiAgICAgICAgICAgICAgICBxLnB1c2goY2hpbGQpOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgfQoKICAgIHJldHVybiAwOwp9