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

import java.io.*;
import java.text.*;
import java.util.*;
import java.math.*;
public class template {
	public static void main(String[] args) throws Exception {
		new template().run();
	}
	public void run() throws Exception {
		FastScanner f = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		int n = f.nextInt();
		min = new int[4*n];
		max = new int[4*n];
		for(int i = 0; i < min.length; i++) {
			min[i] = 2147483647;
			max[i] = -2147483648;
		}
		PriorityQueue<Pair> pq = new PriorityQueue<>();
		LinkedList<Pair>[] ll = new LinkedList[n];
		for(int i = 0; i < n; i++) ll[i] = new LinkedList<>();
		for(int i = 0; i < n; i++) {
			int a = f.nextInt()-1, b = f.nextInt()-1;
			ll[a].add(new Pair(b, i, a));
		}
		Pair[] arr = new Pair[n];
		for(int i = 0; i < n; i++) {
			for(Pair p : ll[i]) pq.add(p);
			Pair p = pq.poll();
			arr[i] = p;
			insMin(0, 0, n, i, p.c);
			insMax(0, 0, n, i, p.a);
		}
		boolean found = false;
		for(int i = 0; i < n; i++) {
			if(getMax(0, 0, n, arr[i].c, i) >= i) {
				out.println("NO");
				int[] ans = new int[n];
				for(int a = 0; a < n; a++) ans[arr[a].b] = a;
				for(int a : ans) out.print(a + 1 + " ");
				out.println();
				int j;
				for(j = arr[i].c; j < i; j++)
					if(arr[j].a >= i)
						break;
				ans[arr[j].b] = i;
				ans[arr[i].b] = j;
				for(int a : ans) out.print(a + 1 + " ");
				out.println();
				found = true;
				break;
			}
			if(getMin(0, 0, n, i+1, arr[i].a+1) <= i) {
				out.println("NO");
				int[] ans = new int[n];
				for(int a = 0; a < n; a++) ans[arr[a].b] = a;
				for(int a : ans) out.print(a + 1 + " ");
				out.println();
				int j;
				for(j = i+1; j <= arr[i].a; j++)
					if(arr[j].c <= i)
						break;
				ans[arr[j].b] = i;
				ans[arr[i].b] = j;
				for(int a : ans) out.print(a + 1 + " ");
				out.println();
				found = true;
				break;
			}
		}
		if(!found) {
			out.println("YES");
			int[] ans = new int[n];
			for(int i = 0; i < n; i++) ans[arr[i].b] = i;
			for(int i : ans) out.print(i + 1 + " ");
			out.println();
		}
		out.flush();
	}

	class Pair implements Comparable<Pair> {
		int a, b, c;
		public Pair(int a, int b, int c) {
			this.a = a;
			this.b = b;
			this.c = c;
		}
		public int compareTo(Pair p) {
			return Integer.compare(a, p.a);	
		}
	}
	int[] min, max;
	public int getMax(int i, int l, int r, int ql, int qr) {
		if(ql < l) ql = l;
		if(qr > r) qr = r;
		if(qr <= l || ql >= r) return -2147483648;
		if(ql == l && qr == r) return max[i];
		int m = (l+r)/2;
		return Math.max(getMax(2*i+1, l, m, ql, qr),getMax(2*i+2, m, r, ql, qr));
	}
	public int getMin(int i, int l, int r, int ql, int qr) {
		if(ql < l) ql = l;
		if(qr > r) qr = r;
		if(qr <= l || ql >= r) return 2147483647;
		if(ql == l && qr == r) return min[i];
		int m = (l+r)/2;
		return Math.min(getMin(2*i+1, l, m, ql, qr),getMin(2*i+2, m, r, ql, qr));
	}
	public void insMax(int i, int l, int r, int qi, int qv) {
		max[i] = Math.max(max[i],qv);
		if(l != r-1) {
			int m = (l+r)/2;
			if(qi < m) insMax(2*i+1, l, m, qi, qv);
			else insMax(2*i+2, m, r, qi, qv);
		}
	}
	public void insMin(int i, int l, int r, int qi, int qv) {
		min[i] = Math.min(min[i],qv);
		if(l != r-1) {
			int m = (l+r)/2;
			if(qi < m) insMin(2*i+1, l, m, qi, qv);
			else insMin(2*i+2, m, r, qi, qv);
		}
	}
    static class FastScanner {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
        public FastScanner() {
            reader = new BufferedReader(new InputStreamReader(System.in), 32768);
            tokenizer = null;
        }
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
        	return Long.parseLong(next());
        }
        public double nextDouble() {
        	return Double.parseDouble(next());
        }
        public String nextLine() {
        	try {
        		return reader.readLine();
        	} catch(IOException e) {
        		throw new RuntimeException(e);
        	}
        }
    }
}
