#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;

vector<int> solve(int n, const std::vector<int64_t> &a, const std::vector<int64_t> &b) {
    vector<vector<int>> g(n);
    REP (i, n) {
        g[a[i]].push_back(i);
        g[b[i]].push_back(i);
    }
    vector<int> ans(n, -1);
    vector<bool> visited(n);
    vector<bool> removed(n);
    vector<bool> used_edge(n);
    auto go = [&](auto &&go, int x) -> void {
        visited[x] = true;
        for (int i : g[x]) {
            if (used_edge[i]) continue;
            used_edge[i] = true;
            int y = x ^ a[i] ^ b[i];
            if (not visited[y]) {
                go(go, y);
            }
            ans[i] = (not removed[y] ? y : x);
            removed[ans[i]] = true;
        }
    };
    REP (x, n) {
        if (not visited[x]) {
            go(go, x);
        }
    }
    if (find(ALL(removed), false) != removed.end()) {
        return vector<int>();
    }
    return ans;
}

const std::string YES = "Yes";
const std::string NO = "No";
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N;
    std::cin >> N;
    std::vector<int64_t> A(N), B(N);
    REP (i, N) {
        std::cin >> A[i] >> B[i];
        -- A[i];
        -- B[i];
    }
    auto ans = solve(N, A, B);
    if (ans.empty()) {
        cout << NO << endl;
    } else {
        cout << YES << endl;
        for (int i : ans) {
            std::cout << i + 1 << '\n';
        }
    }
    return 0;
}