#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class F> struct RecursiveLambda : private F {
    explicit constexpr RecursiveLambda(F&& f) : F(std::forward<F>(f)) {}
    template <class... Args> constexpr decltype(auto) operator()(Args&&... args) const {
        return F::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class F> constexpr decltype(auto) rec_lambda(F&& f) {
    using G = std::decay_t<F>;
    return RecursiveLambda<G>(std::forward<G>(f));
}

template <class T> using Vec = std::vector<T>;

void main_() {
    usize N;
    std::cin >> N;
    Vec<usize> A(N), B(N);
    Vec<Vec<std::pair<usize, usize>>> graph(N);
    for (const auto i : rep(0, N)) {
        std::cin >> A[i] >> B[i];
        A[i] -= 1;
        B[i] -= 1;
        graph[A[i]].emplace_back(B[i], i);
        graph[B[i]].emplace_back(A[i], i);
    }
    Vec<usize> depth(N), pedge(N), select(N);
    for (const auto root : rep(0, N)) {
        if (depth[root] == 0) {
            usize rev = N;
            depth[root] = 1;
            pedge[root] = N;
            rec_lambda([&](auto&& dfs, const usize u) -> void {
                for (const auto& [v, e] : graph[u]) {
                    if (e == pedge[u]) {
                        continue;
                    }
                    select[e] = v;
                    if (depth[v] > 0) {
                        rev = e;
                    } else {
                        depth[v] = depth[u] + 1;
                        pedge[v] = e;
                        dfs(v);
                    }
                }
            })(root);
            if (rev == N) {
                std::cout << "No\n";
                return;
            }
            while (rev != N) {
                const auto t = (depth[A[rev]] < depth[B[rev]] ? A[rev] : B[rev]);
                select[rev] = t;
                rev = pedge[t];
            }
        }
    }
    std::cout << "Yes\n";
    for (const auto x : select) {
        std::cout << x + 1 << '\n';
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    main_();
    return 0;
}