CF1348F.Phoenix and Memory

Phoenix is trying to take a photo of his $n$ friends with labels $1, 2, \dots, 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?

凤凰正试图为他的 $n$ 位朋友（编号为 $1, 2, \dots, n$）拍照，这些朋友原本按某种特定顺序排成一列。但就在他拍照前，朋友们被一只鸭子吸引而打乱了队形。

现在，凤凰必须恢复原来的顺序，但他记不太清了！他只记得：从左往右数第 $i$ 位朋友的编号在 $a_i$ 和 $b_i$ 之间（含端点）。根据他的记忆，是否存在唯一一种方式来排列他的朋友们？

The first line contains one integer $n$ ($1 \le n \le 2\cdot10^5$) — the number of friends.

The $i$-th of the next $n$ lines contain two integers $a_i$ and $b_i$ ($1 \le a_i \le b_i \le 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.

第一行包含一个整数 $n$（$1 \le n \le 2\cdot10^5$）——朋友的数量。

接下来的 $n$ 行中，第 $i$ 行包含两个整数 $a_i$ 和 $b_i$（$1 \le a_i \le b_i \le n$）——凤凰对从左起第 $i$ 个位置的记忆。

保证凤凰的记忆是有效的，即至少存在一种合法的排列。

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.

如果凤凰可以将他的朋友们重新排列成一种唯一的顺序，则输出 YES，然后输出 $n$ 个整数——第 $i$ 个整数应为从左往右数第 $i$ 个朋友的编号。

否则，输出 NO。接着，在接下来的两行中分别输出任意两个不同的合法排列。若存在多种解，输出任意一种即可。