#include<bits/stdc++.h>
//#include<atcoder/all>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace atcoder;
//using namespace boost::multiprecision;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const ll mod=1e9 + 7;
const ll LINF=1ll<<60;
const int INF=1<<30;
//int dx[]={0,1,0,-1,0,1,-1,1,-1};
//int dy[]={0,0,1,0,-1,1,-1,-1,1};
int dx[]={0,0,1,-1};
int dy[]={-1,1,0,0};



const int M_N=500001;

struct UnionFind{
    int par[M_N];
    int rank[M_N];
    int sz[M_N];
    int p[M_N];

    void init(int n){
        for(int i=0;i<n;i++){
            par[i]=i;
            rank[i]=0;
            sz[i]=1;
            p[i]=0;
        }
    }

    int find(int x){
        if(par[x]==x){
            return x;
        }
        else{
            return par[x]=find(par[x]);
        }
    }

    void unite(int x,int y){
        x=find(x);
        y=find(y);
        if(x==y){
            p[x]++;
            return;
        }
        if(rank[x]<rank[y]){
            par[x]=y;
            sz[y]+=sz[x];
            p[y]+=p[x]+1;
        }
        else{
            par[y]=x;
            sz[x]+=sz[y];
            p[x]+=p[y]+1;
            if(rank[x]==rank[y]) rank[x]++;
        }
    }

    int size(int x){
        return sz[find(x)];
    }

    int getp(int x){
        return p[find(x)];
    }

    bool same(int x,int y){
        return find(x)==find(y);
    }
};
vector<int> G[1<<17];
map<pair<int,int>, int> id;
vector<int> Ans(1 << 17, 0);
vector<bool> used(1 << 17, false);
set<int> s;

void dfs(int u, int v){
    for(auto g:G[u]){
        if(g == v) continue;
        if(used[id[{u, g}]]) continue;
        used[id[{u, g}]] = true;
        Ans[id[{u, g}]] = g + 1;
        s.insert(g + 1);
        dfs(g, v);
    }
    return;
}


int main(){
    int n;cin >> n;
    vector<int> a(n),b(n);
    UnionFind uf;
    uf.init(n);
    vector<bool> f(n , false);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
        a[i]--,b[i]--;
        G[a[i]].pb(b[i]);
        G[b[i]].pb(a[i]);
        id[{a[i], b[i]}] = i;
        id[{b[i], a[i]}] = i;
        uf.unite(a[i],b[i]);
        if(uf.getp(a[i]) == uf.size(a[i])) f[a[i]] = true;
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        if(uf.find(i)==i){
            if(uf.getp(i) >= uf.size(i)) ans += uf.size(i);
            else ans += uf.size(i) - 1;
        }
    }
    if(ans == n){
        puts("Yes");
        for (int i = 0; i < n; i++) {
            if(f[i]) dfs(i, i);
        }
        for (int i = 0; i < n; i++) {
            if(Ans[i] == 0){
                if(s.find(a[i] + 1) == s.end()) cout << a[i] + 1 << endl;
                else cout << b[i] + 1 << endl;
            }
            else{
                cout << Ans[i] << endl;
            }
        }
    }
    else puts("No");
    return 0;
}