#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
class DebugStream {
} LOG;
template <typename T>
DebugStream &operator<<(DebugStream &s, const T &) {
  return s;
}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 2e5 + 9, maxV = 1e6 + 9, MOD = 1e9 + 7, SQ = 335, lg = 20,
          bs = 29;
int le[maxN], ri[maxN], n, rsp = -1, nxt[maxN];
vector<int> solve(int cnd) {
  vector<int> inds(n), ret(n);
  iota(inds.begin(), inds.end(), 0);
  sort(inds.begin(), inds.end(), [&](int a, int b) { return le[a] < le[b]; });
  auto compare = [&](int a, int b) {
    return ri[a] > ri[b] || (ri[a] == ri[b] && a > b);
  };
  priority_queue<int, vector<int>, decltype(compare)> pq(compare);
  int cr = 0;
  auto fn = [&]() {
    int tpp = pq.top();
    pq.pop();
    if (pq.size()) {
      nxt[tpp] = pq.top();
    }
    ret[tpp] = cr++;
  };
  for (int i = 0, j = 0; i < n; i = j) {
    while (le[inds[i]] > cr) fn();
    for (; j < n && le[inds[i]] == le[inds[j]]; j++) pq.push(inds[j]);
  }
  while (pq.size()) fn();
  return ret;
}
void prt(vector<int> vc) {
  for (auto el : vc) cout << el + 1 << ' ';
  cout << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> le[i] >> ri[i];
    le[i]--;
    42;
    nxt[i] = -1;
  }
  auto uno = solve(1);
  for (int i = 0; i < n; i++) {
    if (nxt[i] != -1 && uno[nxt[i]] < ri[i]) {
      cout << "NO\n";
      prt(uno);
      swap(uno[i], uno[nxt[i]]);
      prt(uno);
      exit(0);
    }
  }
  cout << "YES\n";
  prt(uno);
  exit(0);
}
