#include <bits/stdc++.h>
using namespace std;
pair<int, int> st[1000005], mn;
pair<pair<int, int>, int> a[200005];
pair<int, pair<pair<int, int>, int> > b[200005];
int n, kq[200005];
set<int> s;
void update(int id, int l, int r, int vt, pair<int, int> gt) {
  if (l > r || l > vt || r < vt) return;
  if (l == r) {
    st[id] = min(st[id], gt);
    return;
  }
  int mid = (l + r) / 2;
  update(id * 2, l, mid, vt, gt);
  update(id * 2 + 1, mid + 1, r, vt, gt);
  st[id] = min(st[id * 2], st[id * 2 + 1]);
}
pair<int, int> get(int id, int l, int r, int u, int v) {
  if (l > r || l > v || r < u) return {1e9, 0};
  if (l >= u && r <= v) return st[id];
  int mid = (l + r) / 2;
  return min(get(id * 2, l, mid, u, v), get(id * 2 + 1, mid + 1, r, u, v));
}
bool cmp(pair<pair<int, int>, int> x, pair<pair<int, int>, int> y) {
  if (x.first.second != y.first.second) return x.first.second < y.first.second;
  return x.first.first < y.first.first;
}
void build(int id, int l, int r) {
  if (l > r) return;
  st[id] = {1e9, 0};
  if (l == r) return;
  int mid = (l + r) / 2;
  build(id * 2, l, mid);
  build(id * 2 + 1, mid + 1, r);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i].first.first >> a[i].first.second;
    a[i].second = i;
  }
  sort(a + 1, a + n + 1, cmp);
  for (int i = 1; i <= n; ++i) s.insert(i);
  for (int i = 1; i <= n; ++i) {
    kq[a[i].second] = (*s.lower_bound(a[i].first.first));
    s.erase(kq[a[i].second]);
    b[i] = {kq[a[i].second], a[i]};
  }
  build(1, 1, n);
  sort(b + 1, b + n + 1);
  for (int i = n; i > 0; --i) {
    mn = get(1, 1, n, b[i].first + 1, b[i].second.first.second);
    if (mn.first <= b[i].first) {
      cout << "NO" << '\n';
      for (int i = 1; i <= n; ++i) cout << kq[i] << ' ';
      cout << '\n';
      swap(kq[b[i].second.second], kq[b[mn.second].second.second]);
      for (int i = 1; i <= n; ++i) cout << kq[i] << ' ';
      return 0;
    }
    update(1, 1, n, b[i].first, {b[i].second.first.first, i});
  }
  cout << "YES" << '\n';
  for (int i = 1; i <= n; ++i) cout << kq[i] << ' ';
  return 0;
}
