Tree Reconstruction

### 题目大意： 有一棵树，现在给你每条树边被去掉时，形成的两个联通块中点的最大的编号分别是多少，问满足条件的树存不存在 ### 输入格式： 第一行一个整数$n$ 往下$n-1$行，每行两个整数，表示去掉这条边后两个联通块中点的最大的编号是多少 ### 输出格式： 如果不存在满足条件的树，输出"NO" 否则输出"YES"，下面$n-1$行每行描述一条树边（两端点的编号）

Monocarp has drawn a tree (an undirected connected acyclic graph) and then has given each vertex an index. All indices are distinct numbers from $ 1 $ to $ n $ . For every edge $ e $ of this tree, Monocarp has written two numbers: the maximum indices of the vertices of the two components formed if the edge $ e $ (and only this edge) is erased from the tree. Monocarp has given you a list of $ n - 1 $ pairs of numbers. He wants you to provide an example of a tree that will produce the said list if this tree exists. If such tree does not exist, say so.

The first line contains one integer $ n $ ( $ 2 \le n \le 1\,000 $ ) — the number of vertices in the tree. Each of the next $ n-1 $ lines contains two integers $ a_i $ and $ b_i $ each ( $ 1 \le a_i < b_i \le n $ ) — the maximal indices of vertices in the components formed if the $ i $ -th edge is removed.

If there is no such tree that can produce the given list of pairs, print "NO" (without quotes). Otherwise print "YES" (without quotes) in the first line and the edges of the tree in the next $ n - 1 $ lines. Each of the last $ n - 1 $ lines should contain two integers $ x_i $ and $ y_i $ ( $ 1 \le x_i, y_i \le n $ ) — vertices connected by an edge. Note: The numeration of edges doesn't matter for this task. Your solution will be considered correct if your tree produces the same pairs as given in the input file (possibly reordered). That means that you can print the edges of the tree you reconstructed in any order.

4
3 4
1 4
3 4

YES
1 3
3 2
2 4

3
1 3
1 3

NO

3
1 2
2 3

NO

Possible tree from the first example. Dotted lines show edges you need to remove to get appropriate pairs.