#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long mod = 1000000007;
const long long linf = 0x3f3f3f3f3f3f3f3f;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
int ans[200100];
int a[200100], b[200100];
set<pair<int, int> > s;
pair<int, int> e[200100];
pair<int, int> change;
set<pair<int, int> > l, r;
pair<int, int> pos[200100];
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
  for (int i = 0; i < n; i++) e[i].first = a[i], e[i].second = i;
  sort(e, e + n);
  int j = 1;
  for (int i = 0; i < n; i++) {
    while (e[i].first > j) {
      pair<int, int> r = *s.begin();
      s.erase(r);
      ans[r.second] = j;
      j++;
    }
    s.insert({b[e[i].second], e[i].second});
  }
  for (auto r : s) {
    ans[r.second] = j;
    j++;
  }
  for (int i = 0; i < n; i++) {
    pos[i].first = ans[i];
    pos[i].second = i;
  }
  sort(pos, pos + n);
  change = {-1, -1};
  for (int i = 0; i < n; i++) {
    while (!r.empty() && pos[i].first > (*r.begin()).first) {
      int j = (*r.begin()).second;
      l.erase({pos[j].first, j});
      r.erase(r.begin());
    }
    if (!l.empty()) {
      auto it = l.lower_bound({a[pos[i].second], 0});
      if (it != l.end()) {
        change.first = pos[i].second;
        change.second = pos[(*it).second].second;
        break;
      }
    }
    l.insert({pos[i].first, i});
    r.insert({b[pos[i].second], i});
  }
  if (change.first != -1) {
    cout << "NO\n";
    for (int i = 0; i < n; i++) {
      cout << ans[i] << " ";
    }
    cout << "\n";
    swap(ans[change.first], ans[change.second]);
    for (int i = 0; i < n; i++) {
      cout << ans[i] << " ";
    }
    cout << "\n";
  } else {
    cout << "YES\n";
    for (int i = 0; i < n; i++) {
      cout << ans[i] << " ";
    }
    cout << "\n";
  }
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  ;
  solve();
  return 0;
}
