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 
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 200;
int n, ai[MAX_N], bi[MAX_N], seq[MAX_N], pos[MAX_N];
vector<pair<int, int> > vec[MAX_N];
pair<int, int> nodes[MAX_N << 2];
pair<int, int> pushup(pair<int, int> ls, pair<int, int> rs) {
  if (ls.first == -1) return rs;
  if (rs.first == -1) return ls;
  return min(ls, rs);
}
void build(int l, int r, int p) {
  if (l == r) return (void)(nodes[p] = make_pair(ai[pos[l]], l));
  build(l, ((l + r) >> 1), (p << 1)),
      build(((l + r) >> 1) + 1, r, ((p << 1) | 1));
  nodes[p] = pushup(nodes[(p << 1)], nodes[((p << 1) | 1)]);
}
pair<int, int> query(int ql, int qr, int l, int r, int p) {
  if (ql <= l && r <= qr) return nodes[p];
  pair<int, int> ls = make_pair(-1, -1), rs = make_pair(-1, -1);
  if (ql <= ((l + r) >> 1)) ls = query(ql, qr, l, ((l + r) >> 1), (p << 1));
  if (((l + r) >> 1) < qr)
    rs = query(ql, qr, ((l + r) >> 1) + 1, r, ((p << 1) | 1));
  return pushup(ls, rs);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++)
    scanf("%d%d", &ai[i], &bi[i]), vec[ai[i]].push_back(make_pair(bi[i], i));
  set<pair<int, int> > st;
  for (int i = 1; i <= n; i++) {
    st.insert(vec[i].begin(), vec[i].end());
    seq[st.begin()->second] = i;
    pos[i] = st.begin()->second;
    st.erase(st.begin());
  }
  build(1, n, 1);
  for (int i = 1; i <= n; i++) {
    if (i + 1 > bi[pos[i]]) continue;
    pair<int, int> res = query(i + 1, bi[pos[i]], 1, n, 1);
    if (res.first <= i) {
      puts("NO");
      for (int i = 1; i <= n; i++) printf("%d ", seq[i]);
      puts("");
      swap(seq[pos[res.second]], seq[pos[i]]);
      for (int i = 1; i <= n; i++) printf("%d ", seq[i]);
      puts("");
      exit(0);
    }
  }
  puts("YES");
  for (int i = 1; i <= n; i++) printf("%d ", seq[i]);
  puts("");
  return 0;
}
