#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

struct UnionFind {
  UnionFind(int n) : data(n, -1) {}

  int root(int ver) { return data[ver] < 0 ? ver : data[ver] = root(data[ver]); }

  bool unite(int u, int v) {
    u = root(u);
    v = root(v);
    if (u == v) return false;
    if (data[u] > data[v]) std::swap(u, v);
    data[u] += data[v];
    data[v] = u;
    return true;
  }

  bool same(int u, int v) { return root(u) == root(v); }

  int size(int ver) { return -data[root(ver)]; }

private:
  std::vector<int> data;
};

int main() {
  int n; cin >> n;
  vector<int> a(n), b(n); REP(i, n) cin >> a[i] >> b[i], --a[i], --b[i];
  vector<int> painted(n, false), ans(n, -1);
  vector<set<int>> cand(n);
  UnionFind uf(n);
  REP(i, n) {
    if (painted[a[i]] && painted[b[i]]) {
      cout << "No\n";
      return 0;
    }
    int choice = -1;
    if (painted[a[i]]) {
      choice = b[i];
    } else if (painted[b[i]] || !uf.unite(a[i], b[i])) {
      choice = a[i];
    } else {
      cand[a[i]].emplace(i);
      cand[b[i]].emplace(i);
    }
    if (choice == -1) continue;
    painted[choice] = true;
    ans[i] = choice;
    queue<int> que({choice});
    while (!que.empty()) {
      int ball = que.front(); que.pop();
      for (int id : cand[ball]) {
        const int target = (a[id] == ball ? b : a)[id];
        if (painted[target]) {
          cout << "No\n";
          return 0;
        }
        painted[target] = true;
        ans[id] = target;
        cand[target].erase(id);
        que.emplace(target);
      }
    }
  }
  if (count(ALL(painted), false) > 0) {
    cout << "No\n";
  } else {
    cout << "Yes\n";
    REP(i, n) cout << ans[i] + 1 << '\n';
  }
  return 0;
}