#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
//#pragma GCC optimize("Ofast")
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

struct edge{
        int to, id;
        edge(){}
        edge(int a, int b) : to(a), id(b){}
    };
using ve = vector<edge>;


int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N;
    vec res(N, -1), roots;
    vector<bool> visited(N, false);
    vector<ve> G(N);
    dsu d(N);
    rep(i, N){
        int a, b;
        cin>>a>>b;
        --a; --b;
        if(d.same(a, b)){
            roots.push_back(a);
            res[i] = a;
        }else {
            d.merge(a, b);
            G[a].emplace_back(b, i);
            G[b].emplace_back(a, i);
        }
    }
    auto dfs = [&](auto &&self, edge p) -> void{
        if(p.id != -1) res[p.id] = p.to;
        visited[p.to] = true;
        for(edge e : G[p.to]) if(!visited[e.to]) {
            self(self, e);
        }
    };
    for(int p : roots) {
        dfs(dfs, edge(p, -1));
    }
    if(*min_element(ALL(res)) == -1 || *min_element(ALL(visited)) == false){
        cout<<"No"<<endl;
    }else {
        cout<<"Yes"<<endl;
        rep(i, N) cout << res[i] + 1 << endl;
    }
}