#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #if __has_include() #include 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 bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; } template bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; } templateistream& operator>>(istream&i,vector&v){rep(j,v.size())i>>v[j];return i;} templatestring join(vector&v){stringstream s;rep(i,v.size())s<<' '<ostream& operator<<(ostream&o,vector&v){if(v.size())o<string join(vector>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;} templateostream& operator<<(ostream&o,vector>&vv){if(vv.size())o<>> edge; vector 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; } f = 1; continue; } if (e == now){ res = true; continue; } if (visited[e]){ res = true; continue; } visited[e] = 1; res |= dfs(e, now); } return res; } int main(){ int n; cin >> n; edge.resize(n); visited.resize(n, 0); vector 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 ans(n, -1); queue 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]++; cout << ans << endl; }