#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;
}