#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<vector<pair<int, int>>> E(N);
  for (int i = 0; i < N; i++){
    int A, B;
    cin >> A >> B;
    A--;
    B--;
    E[A].push_back(make_pair(i, B));
    E[B].push_back(make_pair(i, A));
  }
  bool ok = true;
  vector<int> ans(N);
  vector<bool> used(N, false);
  vector<int> d(N);
  for (int i = 0; i < N; i++){
    d[i] = E[i].size();
  }
  for (int i = 0; i < N; i++){
    if (!used[i]){
      used[i] = true;
      vector<int> id_v;
      set<int> id_e;
      queue<int> Q;
      Q.push(i);
      while (!Q.empty()){
        int v = Q.front();
        Q.pop();
        id_v.push_back(v);
        for (auto P : E[v]){
          id_e.insert(P.first);
          int w = P.second;
          if (!used[w]){
            used[w] = true;
            Q.push(w);
          }
        }
      }
      if (id_v.size() != id_e.size()){
        ok = false;
        break;
      }
      queue<int> Q2;
      for (int v : id_v){
        if (d[v] == 1){
          Q2.push(v);
        }
      }
      while (!Q2.empty()){
        int v = Q2.front();
        Q2.pop();
        for (auto P : E[v]){
          int id = P.first;
          int w = P.second;
          d[w]--;
          if (d[w] > 0){
            ans[id] = v;
          }
          if (d[w] == 1){
            Q2.push(w);
          }
        }
      }
      vector<int> cycle;
      for (int v : id_v){
        if (d[v] == 2){
          cycle.push_back(v);
          used[v] = false;
        }
      }
      vector<int> cycle_v = {cycle[0]};
      vector<int> cycle_e;
      while (true){
        int v = cycle_v.back();
        used[v] = true;
        bool ok2 = false;
        for (auto P : E[v]){
          int id = P.first;
          int w = P.second;
          if (!used[w]){
            cycle_e.push_back(id);
            cycle_v.push_back(w);
            ok2 = true;
            break;
          }
        }
        if (!ok2){
          for (auto P : E[v]){
            int id = P.first;
            int w = P.second;
            if (w == cycle[0]){
              bool ok3 = true;
              if (cycle_e.size() == 1){
                if (cycle_e[0] == id){
                  ok3 = false;
                }
              }
              if (ok3){
                cycle_e.push_back(id);
                break;
              }
            }
          }
          break;
        }
      }
      int cnt = cycle.size();
      for (int j = 0; j < cnt; j++){
        ans[cycle_e[j]] = cycle_v[j];
      }
    }
  }
  if (!ok){
    cout << "No" << endl;
  } else {
    cout << "Yes" << endl;
    for (int i = 0; i < N; i++){
      cout << ans[i] + 1 << endl;
    }
  }
}