#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<vector<P>> to(n);
    rep(i, n) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        to[a].emplace_back(b, i);
        to[b].emplace_back(a, i);
    }
    vector<char> visited(n), col(n), used(n);
    VI ans(n);
    auto dfs = [&](auto&& self, int u) -> bool {
        visited[u] = true;
        bool ret = false;
        for(auto [v, i]: to[u]) if (!used[i]) {
            used[i] = true;
            if (visited[v]) {
                ans[i] = u;
                col[u] = true;
                ret = true;
                continue;
            }
            bool r = self(self, v);
            if (r) {
                ans[i] = u;
                col[u] = true;
                ret = true;
            } else {
                ans[i] = v;
                col[v] = true;
            }
        }
        return ret;
    };
    rep(i, n) if (!visited[i]) dfs(dfs, i);
    bool ok = true;
    rep(i, n) ok &= col[i];
    if (!ok) {
        cout << "No" << endl;
        return 0;
    }
    cout << "Yes" << endl;
    rep(i, n) cout << ans[i] + 1 << '\n';
}