#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
#include <atcoder/maxflow>
using namespace atcoder;
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N;
  cin >> N;
  vector<int> A(N), B(N);
  REP(i, N) cin >> A[i] >> B[i];
  REP(i, N) A[i]--;
  REP(i, N) B[i]--;
  mf_graph<int> g(2*N+2);
  REP(i, N) {
    g.add_edge(i, A[i]+N, 1);
    g.add_edge(i, B[i]+N, 1);
  }
  REP(i, N) g.add_edge(2*N, i, 1);
  REP(i, N) g.add_edge(i+N, 2*N+1, 1);
  int f = g.flow(2*N, 2*N+1);
  if(f < N) {
    cout << "No" << endl;
    return 0;
  }
  cout << "Yes" << endl;
  auto e = g.edges();
  REP(i, N) {
    if(e[i*2].flow == 1) cout << A[i]+1 << "\n";
    else cout << B[i]+1 << "\n";
  }
}