#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int L[MAXN], R[MAXN];
int pos[MAXN], ans[MAXN];
vector<pair<int, int> > E[MAXN];
set<pair<int, int> > sv;
int n;
struct seg {
  int mi[MAXN << 2];
  void push_up(int rt) { mi[rt] = min(mi[rt << 1], mi[rt << 1 | 1]); }
  void build(int l, int r, int rt) {
    if (l == r) {
      mi[rt] = L[pos[l]];
      return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, rt << 1);
    build(mid + 1, r, rt << 1 | 1);
    push_up(rt);
  }
  int query(int L, int R, int l, int r, int rt) {
    if (L > R) return 1e9;
    if (L <= l && r <= R) return mi[rt];
    int mid = (l + r) >> 1;
    int ret = 1e9;
    if (L <= mid) ret = min(ret, query(L, R, l, mid, rt << 1));
    if (mid < R) ret = min(ret, query(L, R, mid + 1, r, rt << 1 | 1));
    return ret;
  }
} se;
void print() {
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  puts("");
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &L[i], &R[i]);
    E[L[i]].push_back(make_pair(R[i], i));
  }
  for (int i = 1; i <= n; i++) {
    sv.insert(E[i].begin(), E[i].end());
    int id = (*sv.begin()).second;
    pos[i] = id;
    ans[id] = i;
    sv.erase(sv.begin());
  }
  se.build(1, n, 1);
  for (int i = 1; i <= n; i++) {
    int mi = se.query(i + 1, R[pos[i]], 1, n, 1);
    if (mi <= i) {
      puts("NO");
      for (int j = i + 1; j <= R[pos[i]]; j++)
        if (L[pos[j]] == mi) {
          print();
          swap(ans[pos[i]], ans[pos[j]]);
          print();
          return 0;
        }
    }
  }
  puts("YES");
  print();
  return 0;
}
