#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
struct unionfind{
    vector<int> par, sz;
    unionfind() {}
    unionfind(int n):par(n), sz(n, 1){
        for(int i=0; i<n; i++) par[i]=i;
    }
    int find(int x){
        if(par[x]==x) return x;
        return par[x]=find(par[x]);
    }
    void unite(int x, int y){
        x=find(x); y=find(y);
        if(x==y) return;
        if(sz[x]>sz[y]) swap(x, y);
        par[x]=y;
        sz[y]+=sz[x];
    }
    bool same(int x, int y){
        return find(x)==find(y);
    }
    int size(int x){
        return sz[find(x)];
    }
};
int main()
{
    int n; cin>>n;
    int a[100010], b[100010];
    unionfind uf(n);
    bool ok[100010]={};
    for(int i=0; i<n; i++){
        cin>>a[i]>>b[i];
        a[i]--; b[i]--;
        if(uf.same(a[i], b[i])){
            ok[i]=1;
        }
        uf.unite(a[i], b[i]);
    }
    int c[100010]={}, e[100010]={};
    for(int i=0; i<n; i++){
        c[uf.find(i)]++;
        e[uf.find(a[i])]++;
    }
    for(int i=0; i<n; i++){
        if(c[i]==0) continue;
        if(c[i]-1==e[i]){
            cout<<"No"<<endl;
            return 0;
        }
    }
    vector<P> g[100010];
    int i0;
    bool used[100010]={};
    int ans[100010];
    auto dfs=[&](auto dfs, int x)->void{
        used[x]=1;
        for(auto q:g[x]){
            if(i0==q.second || used[q.first]) continue;
            int y=q.first;
            dfs(dfs, y);
            ans[q.second]=y;
        }
    };
    for(int i=0; i<n; i++){
        g[a[i]].push_back({b[i], i});
        g[b[i]].push_back({a[i], i});
    }
    for(int i=0; i<n; i++){
        if(used[a[i]]) continue;
        if(!ok[i]) continue;
        i0=i;
        dfs(dfs, a[i]);
        ans[i]=a[i];
    }
    cout<<"Yes"<<endl;
    for(int i=0; i<n; i++) cout<<ans[i]+1<<endl;
    return 0;
}