15287번 - Easy Quest 스페셜 저지다국어

문제

A young hero is starting his heroic life. The wise wizard suggested him an easy first quest. During this quest our young hero meets n magical creatures, in specific order. In order to help the young hero, the wizard gave him a clue — a list of n integers a_i.

• If a_i is positive, then the i-th magical creature is benevolent and gives to our hero one magical item of type a_i. The hero can keep several items of the same type.
• If ai is negative, then the i-th magical creature is evil and in order to defeat it the young hero needs one magical item of type −a_i. All magical items are fragile and can be used only once.
• If a_i is zero, then the i-th creature is a unicorn. It gives the hero any magical item he asks for, but only one.

Your task is to help the young hero to finish the first quest, defeating all enemies on the way, or say that it is impossible.

입력

The first line of input contains one integer n (1 ≤ n ≤ 1000). The second line contains n integers a_i (−1000 ≤ a_i ≤ 1000).

출력

If it is impossible to defeat all enemies, then output one string “No”. If it is possible, then output string “Yes”, and in the next line output the types of items the hero should ask the unicorns for, in order they meet during the quest. Types must be integers in range from 1 to 1000 inclusive. If there are several solutions, output any of them.

제한

힌트