Phoenix is trying to take a photo of his n friends with labels 1, 2, ..., n who are lined up in a row in a special order. But before he can take the photo, his friends get distracted by a duck and mess up their order.

Now, Phoenix must restore the order but he doesn't remember completely! He only remembers that the i-th friend from the left had a label between a_i and b_i inclusive. Does there exist a unique way to order his friends based of his memory? 

Input

The first line contains one integer n (1 ≤ n ≤ 2⋅10^5) — the number of friends.

The i-th of the next n lines contain two integers a_i and b_i (1 ≤ a_i ≤ b_i ≤ n) — Phoenix's memory of the i-th position from the left.

It is guaranteed that Phoenix's memory is valid so there is at least one valid ordering.

Output

If Phoenix can reorder his friends in a unique order, print YES followed by n integers — the i-th integer should be the label of the i-th friend from the left.

Otherwise, print NO. Then, print any two distinct valid orderings on the following two lines. If are multiple solutions, print any.

Examples

Input


4
4 4
1 3
2 4
3 4


Output


YES
4 1 2 3 


Input


4
1 3
2 4
3 4
2 3


Output


NO
1 3 4 2 
1 2 4 3 
4
3 4
1 2
3 4
1 2
 4
2 4
1 3
4 4
1 1
 10
6 6
1 2
2 2
6 7
8 8
3 5
5 5
4 4
8 9
10 10
 4
1 4
1 4
2 4
1 2
 8
3 4
7 8
2 6
1 3
6 7
5 8
4 6
8 8
 7
7 7
2 3
2 3
5 7
5 6
4 4
1 2
 15
2 2
10 11
2 5
6 7
7 12
9 9
2 3
5 14
1 3
10 10
15 15
12 12
5 6
6 6
14 15
 5
1 3
4 4
5 5
1 4
1 5
 4
1 4
2 3
2 3
4 4
 4
1 4
1 4
1 2
1 4
 5
1 3
1 3
1 5
3 4
1 5
 3
1 3
2 2
1 3
 5
4 4
1 4
3 4
1 3
3 5
 3
1 3
1 2
2 3
 4
2 4
1 3
2 3
1 2
 5
4 5
4 5
1 3
1 2
2 4
 6
2 6
4 6
6 6
2 2
3 3
1 3
 3
2 3
1 2
1 3
 6
4 6
1 3
4 6
4 4
1 4
1 2
 7
3 6
6 6
5 7
2 4
2 3
1 2
3 5
 8
4 6
8 8
1 4
4 5
6 8
1 2
3 6
1 4
 6
2 4
2 6
4 5
2 5
6 6
1 4
 8
4 4
7 7
3 5
5 7
1 8
4 5
1 5
2 2
 4
3 4
1 3
2 3
1 2
 10
9 9
3 4
1 1
5 5
7 7
3 7
6 10
3 3
10 10
1 3
 4
1 4
4 4
2 3
1 1
 1
1 1
 8
1 5
6 8
1 3
4 8
1 1
3 3
6 6
8 8
 5
3 3
4 4
2 2
1 1
5 5
 4
1 1
2 3
2 3
1 4
 4
3 4
1 4
2 3
1 2
 2
1 2
1 2
 8
3 3
3 5
2 3
1 1
5 7
7 7
5 5
3 8
 5
2 2
3 3
1 2
1 5
4 4
 6
1 3
2 4
3 4
2 3
5 5
6 6
 6
1 4
3 6
6 6
3 5
1 5
2 5
 5
4 4
2 3
4 5
1 4
2 4
 3
1 2
1 2
1 3
 4
1 4
2 2
3 3
1 4
 5
2 5
1 1
2 3
3 4
5 5
 4
2 4
1 4
3 4
1 3
 6
1 1
4 6
3 6
1 3
3 4
3 6
 5
2 3
3 4
4 5
1 1
2 3
 5
2 3
1 5
2 4
3 5
4 4
 20
12 14
13 13
18 18
3 3
7 8
11 11
10 13
2 2
9 10
3 5
7 8
15 17
14 15
9 9
20 20
15 16
6 6
19 19
1 1
5 5
 5
1 5
2 2
3 3
4 4
1 5
 7
5 7
1 5
1 2
1 5
5 6
3 5
7 7

NO
3 1 4 2
3 2 4 1
 NO
3 2 4 1 
2 3 4 1  YES
6 1 2 7 8 3 5 4 9 10  NO
2 3 4 1 
1 3 4 2 
 YES
3 7 2 1 6 5 4 8  NO
7 2 3 6 5 4 1 
7 3 2 6 5 4 1 
 YES
2 11 4 7 8 9 3 13 1 10 15 12 5 6 14  NO
1 4 5 2 3 
2 4 5 1 3  NO
1 2 3 4 
1 3 2 4 
 NO
2 3 1 4 
1 3 2 4 
 NO
1 2 4 3 5 
2 1 4 3 5 
 NO
1 2 3 
3 2 1 
 NO
4 2 3 1 5 
4 1 3 2 5  NO
2 1 3
1 2 3
 NO
4 2 3 1
4 1 3 2
 NO
4 5 2 1 3
4 5 1 2 3
 NO
4 5 6 2 3 1 
5 4 6 2 3 1 
 NO
2 1 3 
3 1 2 
 NO
5 2 6 4 3 1 
5 1 6 4 3 2 
 NO
5 6 7 3 2 1 4 
5 6 7 2 3 1 4  NO
5 8 2 4 7 1 6 3
5 8 1 4 7 2 6 3
 NO
2 5 4 3 6 1 
3 5 4 2 6 1  YES
4 7 3 6 8 5 1 2  NO
4 2 3 1
4 1 3 2
 YES
9 4 1 5 7 6 8 3 10 2  NO
3 4 2 1 
2 4 3 1  YES
1  NO
4 7 2 5 1 3 6 8 
5 7 2 4 1 3 6 8  YES
3 4 2 1 5  NO
1 2 3 4 
1 3 2 4 
 NO
3 4 2 1 
4 3 2 1 
 NO
1 2 
2 1 
 YES
3 4 2 1 6 7 5 8  YES
2 3 1 5 4  NO
1 3 4 2 5 6
1 2 4 3 5 6
 NO
1 5 6 3 2 4 
2 5 6 3 1 4 
 NO
4 2 5 1 3 
4 3 5 1 2  NO
1 2 3 
2 1 3 
 NO
1 2 3 4 
4 2 3 1 
 NO
4 1 2 3 5 
3 1 2 4 5 
 NO
2 3 4 1
2 1 4 3
 NO
1 4 5 2 3 6 
1 5 4 2 3 6 
 NO
2 4 5 1 3 
3 4 5 1 2 
 NO
2 1 3 5 4 
3 1 2 5 4  NO
14 13 18 3 7 11 12 2 10 4 8 17 15 9 20 16 6 19 1 5 
14 13 18 3 8 11 12 2 10 4 7 17 15 9 20 16 6 19 1 5 
 NO
1 2 3 4 5 
5 2 3 4 1 
 NO
6 2 1 3 5 4 7
6 1 2 3 5 4 7

#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000007;
const long long INFL = 1000000000000000007;
const long double INFS = 0.00000001;
const long long MOD = 1000000007;
const long double PI = 3.14159265;
const int dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
const int dir2[8][2] = {{1, 1},  {1, 0},  {1, -1}, {0, 1},
                        {0, -1}, {-1, 1}, {-1, 0}, {-1, -1}};
long long min(long long x, long long y) { return x < y ? x : y; }
long long minr(vector<long long> x) {
  long long Min = INFL;
  for (auto i : x) Min = min(Min, i);
  return Min;
}
long long max(long long x, long long y) { return x > y ? x : y; }
long long maxr(vector<long long> x) {
  long long Max = -INFL;
  for (auto i : x) Max = max(Max, i);
  return Max;
}
void ex_gcd(long long a, long long b, long long &d, long long &x,
            long long &y) {
  if (!b)
    d = a, x = 1, y = 0;
  else
    ex_gcd(b, a % b, d, y, x), y -= x * (a / b);
}
long long modinv(long long x) {
  long long ret, tr1, tr2;
  ex_gcd(x, MOD, tr1, ret, tr2);
  while (ret < 0) ret += MOD;
  return ret;
}
pair<pair<int, int>, int> a[200001];
set<pair<int, int> > val;
bool ansone = true;
int ans[2][200001];
struct node {
  int l, r;
  int lc, rc;
  int i;
};
node seg[1000001];
void add(int p, int l, int r, int d) {
  if (seg[p].l >= l && seg[p].r <= r) {
    seg[p].i += d;
  } else {
    if (l < (seg[p].l + seg[p].r) / 2) add(seg[p].lc, l, r, d);
    if (r > (seg[p].l + seg[p].r) / 2) add(seg[p].rc, l, r, d);
    int x = seg[p].lc, y = seg[p].rc;
    seg[p].i = min(seg[x].i, seg[y].i);
  }
}
int mini(int p, int l, int r) {
  if (seg[p].l >= l && seg[p].r <= r)
    return seg[p].i;
  else {
    int ret = INF;
    if (l < (seg[p].l + seg[p].r) / 2) ret = min(ret, mini(seg[p].lc, l, r));
    if (r > (seg[p].l + seg[p].r) / 2) ret = min(ret, mini(seg[p].rc, l, r));
    return ret;
  }
}
void build(int p, int l, int r) {
  seg[p].l = l, seg[p].r = r;
  seg[p].lc = 0, seg[p].rc = 0;
  seg[p].i = 0;
  if (l + 1 < r) {
    seg[p].lc = 2 * p, seg[p].rc = 2 * p + 1;
    build(2 * p, l, (l + r) / 2);
    build(2 * p + 1, (l + r) / 2, r);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  int i, j;
  cin >> n;
  for (i = 1; i <= n; i++)
    cin >> a[i].first.first >> a[i].first.second, a[i].second = i;
  sort(a + 1, a + n + 1);
  build(1, 1, n + 1);
  int cur = 1;
  for (i = 1; i <= n; i++) {
    while (cur <= n && a[cur].first.first <= i)
      val.insert({a[cur].first.second, cur}), cur++;
    int f = val.begin()->second;
    val.erase(val.begin());
    ans[0][a[f].second] = i, ans[1][a[f].second] = i;
    add(1, i, i + 1, a[f].first.first);
  }
  for (i = 1; i <= n; i++) {
    int pos1 = ans[0][a[i].second];
    if (a[i].first.second > pos1 &&
        mini(1, pos1 + 1, a[i].first.second + 1) <= pos1) {
      for (j = 1; j <= n; j++) {
        int pos2 = ans[0][a[j].second];
        if (j != i && pos2 > pos1 && pos2 <= a[i].first.second &&
            a[j].first.first <= pos1) {
          int t = ans[1][a[i].second];
          ans[1][a[i].second] = ans[1][a[j].second];
          ans[1][a[j].second] = t;
          break;
        }
      }
      ansone = false;
      break;
    }
  }
  if (ansone) {
    cout << "YES" << endl;
    for (i = 1; i < n; i++) cout << ans[0][i] << " ";
    cout << ans[0][n] << endl;
  } else {
    cout << "NO" << endl;
    for (i = 1; i < n; i++) cout << ans[0][i] << " ";
    cout << ans[0][n] << endl;
    for (i = 1; i < n; i++) cout << ans[1][i] << " ";
    cout << ans[1][n] << endl;
  }
  return 0;
}
