#include <bits/stdc++.h>
using namespace std;
const int N = 200100;
int n, a[N], b[N], p[N], pa[N];
vector<pair<int, int>> g[N];
void output() {
  static int out[N];
  for (int i = 1; i <= n; ++i) {
    out[p[i]] = i;
  }
  for (int i = 1; i <= n; ++i) {
    cout << out[i] << " \n"[i == n];
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i] >> b[i];
    g[a[i]].emplace_back(b[i], i);
  }
  set<pair<int, int>> st;
  for (int i = 1; i <= n; ++i) {
    st.insert(g[i].begin(), g[i].end());
    p[i] = st.begin()->second;
    st.erase(st.begin());
  }
  set<int> ps;
  for (int i = 1; i <= n; ++i) ps.insert(i);
  for (int i = 1; i <= n; ++i) {
    if (!ps.count(i)) continue;
    function<bool(int)> dfs;
    dfs = [&](int u) -> bool {
      int ut = p[u], v;
      for (auto it = ps.lower_bound(a[ut]);
           it != ps.end() && (v = *it) <= b[ut]; it = ps.upper_bound(v)) {
        if (v == u) continue;
        if (pa[v]) {
          cout << "NO\n";
          output();
          for (; u != v; u = pa[u]) {
            p[u] = p[pa[u]];
          }
          p[v] = ut;
          output();
          return true;
        }
        pa[v] = u;
        if (dfs(v)) return true;
        pa[v] = 0;
        ps.erase(v);
      }
      return false;
    };
    pa[i] = i;
    if (dfs(i)) return 0;
    pa[i] = 0;
    ps.erase(i);
  }
  cout << "YES\n";
  output();
  return 0;
}
