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;
pair<int, int> am[200010];
int p1[200010], p2[200010];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  vector<pair<int, int> > swp;
  set<pair<int, int> > dnt;
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> am[i].first >> am[i].second;
    swp.push_back({am[i].first, i});
  }
  sort(swp.begin(), swp.end());
  int j = 0;
  bool existe = false;
  for (int i = 1; i <= n; i++) {
    while (swp[j].first == i && j < n) {
      dnt.insert({am[swp[j].second].second, swp[j].second});
      j++;
    }
    auto v = dnt.begin();
    p1[(*v).second] = i;
    p2[i] = (*v).second;
    dnt.erase(v);
  }
  j = 0;
  dnt.clear();
  set<pair<int, int> > dnth;
  pair<int, int> troca = make_pair(-1, -1);
  for (int i = 1; i <= n; i++) {
    while (swp[j].first == i && j < n) {
      dnt.insert({am[swp[j].second].second, swp[j].second});
      dnth.insert({p1[swp[j].second], swp[j].second});
      j++;
    }
    auto v = dnt.begin();
    p1[(*v).second] = i;
    p2[i] = (*v).second;
    dnt.erase(v);
    auto w = dnth.lower_bound(make_pair(i + 1, 0));
    if (w != dnth.end()) {
      if ((*w).first <= am[p2[i]].second) {
        troca.first = (*v).second;
        troca.second = (*w).second;
      }
    }
  }
  if (troca.first == -1) {
    cout << "YES" << endl;
    for (int i = 1; i <= n; i++) cout << p1[i] << ' ';
    cout << endl;
  } else {
    cout << "NO" << endl;
    for (int i = 1; i <= n; i++) cout << p1[i] << ' ';
    cout << endl;
    int svf = p1[troca.first], svs = p1[troca.second];
    p1[troca.first] = svs, p1[troca.second] = svf;
    for (int i = 1; i <= n; i++) cout << p1[i] << ' ';
    cout << endl;
  }
}
