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

// @iamnifer
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <stack>
#include <deque>
#include <queue>
#include <iomanip>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define ull unsigned long long
#define elif else if
#define pb push_back
#define add insert
#define fastio cout.tie(nullptr); cin.tie(nullptr); ios_base::sync_with_stdio(false)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) (ll)((x).size())
#define gcd __gcd
#define lcm(a, b) (a)/gcd((a), (b))*(b)
#define precision(x) cout << setprecision((x))
#define endl '\n'

using namespace std;
using namespace __gnu_pbds;

typedef pair<ll, ll> pll;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef vector<vector<ll>> graph;

template<typename A, typename B>
void umin(A &a, B b) {
    if (a > b) a = b;
}

template<typename A, typename B>
void umax(A &a, B b) {
    if (a < b) a = b;
}

template<typename B, typename E, typename M>
M binpow(B b, E e, M m) {
    M r = 1;
    while (e > 0) {
        if (e & 1) r = r * b % m;
        b = b * b % m;
        e >>= 1;
    }
    return r;
}

string to_string(string &s) {
    return "\"" + s + "\"";
}

template<typename A, typename B>
string to_string(pair<A, B> v) {
    return "{" + to_string(v.first) + " " + to_string(v.second) + "}";
}

template<typename T>
string to_string(set<T> v) {
    string r = "{", e;
    for (auto i : v) r += e + to_string(i), e = ", ";
    return r + "}";
}

template<typename T>
string to_string(vector<T> v) {
    string r = "{", e;
    for (auto i : v) r += e + to_string(i), e = ", ";
    return r + "}";
}

void debug() {
    cerr << endl;
}

template<typename Head, typename...Tail>
void debug(Head H, Tail...T) {
    cerr << " " << to_string(H);
    debug(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug(__VA_ARGS__)
#else
#define debug(...)
#endif

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma,sse4")
// #pragma comment(linker,"/STACK:128777216")

const ld pi = 3.14159265358979323846264338327950288419716939937510;
const ld eps = 1e-8;
const ll inf = 1e12;
const ll MOD = 1e9 + 7;  // 998244353
const ll maxN = 2e5 + 9;
int main() {
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    fastio;
    int n; cin >> n;
    vector<pair<int, int>> f;
    int ii[n];
    vector<pair<int, int>> sl[n];
    for(int i = 0; i < n; ++i) {
        int l, r;
        cin >> l >> r; --l; --r;
        sl[l].pb({r, i});
    }
    for(auto &i: sl) sort(all(i));
    set<pair<int, int>> pq;
    vector<int> res;
    int sw1 = -1, sw2 = -1;
    for(int i = 0; i < n; ++i) {
        for(auto &j: sl[i]) {
            pq.insert(j);
        }
        int r, ind; tie(r, ind) = *pq.begin();
        if(pq.size() >= 2) {
            pair<int, int> z = (*++pq.begin());
            if(z.first == r) {
                sw1 = ind;
                sw2 = z.second;
            }
        }
        pq.erase(pq.begin());
        ii[ind] = i;
        res.pb(ind);
    }
    vector<int> realres(n);
    for(int i = 0; i < n; ++i) {
        realres[res[i]] = i;
        ii[i] = res[i];
    }
    res = realres;
    if(sw1 != -1) {
        cout << "NO\n";
        vector<int> res2 = res;
        swap(res2[sw1], res2[sw2]);
        for(auto &i: res) cout << i + 1 << ' '; cout << '\n';
        for(auto &i: res2) cout << i + 1 << ' ';
    }
    else {
        cout << "YES\n";
        for(auto &i: res) cout << i + 1 << ' ';
    }
}
