32486번 - Jigsaw Present 스페셜 저지다국어

문제

Julia is preparing a present for James. She will give him some of her $n$ jigsaw puzzles, where puzzle $i$ (1ドル \leq i \leq n$) consists of $x_i$ pieces and has a difficulty $y_i$ (can be negative if the puzzle is very easy).

James is already very excited and would like to know in advance what he will get. Therefore, he used some of his criminal energy to gather information about the gift. In particular, he has managed to obtain an encrypted message containing the total difficulty and total number of pieces of all the puzzles that he will receive.

Now he wonders whether it is worth spending some more time to decrypt the message. After all, it might be that this information is not enough to uniquely determine his gift. Since he was never good at these computer thingies, James asked for your assistance. Help him find out whether it is worth decrypting the message or not. If the answer is negative, you have to find two distinct gifts that result in the same encrypted message.

입력

The input consists of

• One line with an integer $n$ (2ドル \leq n \leq 4,096円$), the number of puzzles that Julia owns.
• $n$ lines, the $i$th of which contains two integers $x_i$ and $y_i$ (1ドル \leq x_i \leq 4,096円,ドル $\left|y_i\right| \leq 4,096円$), the number of pieces of puzzle $i$ and the difficulty of puzzle $i$.

출력

If James can uniquely determine his gift, then print "yes". Otherwise, you should print "no" followed by two lines, where each line contains the description of a present. The description of a present should start with an integer $k,ドル the number of puzzles, followed by $k$ distinct integers, the indices of the puzzles.

Note that the two presents have to be distinct, meaning that there should be at least one puzzle that is contained in one present but not the other.

If there are multiple presents that result in the same encrypted message, you can print any of them.

제한

힌트