#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

vector<vector<pair<int, int>>> edge;
vector<int> visited;

bool dfs(int now, int p){
    bool res = false;
    bool f = 0;
    for (auto [e, _]: edge[now]){
        if (e == p){
            if (f){
                res = true;
                break;
            }
            f = 1;
            continue;
        }
        if (visited[e]){
            res = true;
            break;
        }
        visited[e] = 1;
        res |= dfs(e, now);
    }
    return res;
}

int main(){
    int n;
    cin >> n;
    edge.resize(n);
    visited.resize(n, 0);
    vector<int> cnt(n);
    rep(i, n){
        int a, b;
        cin >> a >> b;
        a--, b--;
        edge[a].emplace_back(b, i);
        edge[b].emplace_back(a, i);
        cnt[a]++;
        cnt[b]++;
    }
    rep(i, n){
        if (!visited[i]){
            visited[i] = 1;
            if (!dfs(i, -1)){
                cout << "No" << endl;
                return 0;
            }
        }
    }
    vector<int> ans(n, -1);
    queue<int> que;
    rep(i, n){
        if (cnt[i] == 1){
            que.emplace(i);
        }
    }
    cout << "Yes" << endl;
    while (!que.empty()){
        auto now = que.front();
        que.pop();
        for (auto [e, i]: edge[now]){
            cnt[e]--;
            if (ans[i] == -1){
                ans[i] = now;
            }
            if (cnt[e] == 1){
                que.emplace(e);
            }
        }
    }
    rep(i, n){
        if (cnt[i] > 1){
            for (auto [e, j]: edge[i]){
                if (ans[j] == -1){
                    ans[j] = i;
                    break;
                }
            }
        }
    }
    rep(i, n) ans[i]++;
    for (auto i: ans) cout << i << "\n";
}