18 人解决，26 人已尝试。
27 份提交通过，共有 56 份提交。
4.8 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
Most financial institutions had become insolvent during financial crisis and went bankrupt or were boughtby larger institutions, usually by banks. By the end of financial crisis of all the financial institutions only two banks still continue to operate. Financial markets had remained closed throughout the crisis andnow regulators are gradually opening them. To prevent speculation and to gradually ramp up trading they will initially allow trading in only one financial instrument and the volume of trading will be limited to $i$ contracts for $i$-th minute of market operation.
Two banks had decided to cooperate with the government to kick-start the market operation. The boards of directors had agreed on trading volume for each minute of this first trading session. One bank willbe buying $a_i$ contracts ($1 \le a_i \le i$) during $i$-th minute ($1 \le i \le n$), while the other one will be selling. They do not really care whether to buy or to sell, and the outside observer will only see the volume $a_i$ of contracts traded per minute. However, they do not want to take any extra risk and want to have no position in the contract by the end of the trading session. Thus, if we define $b_i = 1$ when the first bank is buying and $b_i = −1$ when the second one is buying (and the first one is selling), then the requirementfor the trading session is that $\sum_{i=1}^n a_i b_i = 0$.
Your lucky team of three still works in the data center (due to the crisis, banks now share the data centerand its personnel) and your task is to find such $b_i$ or to report that this is impossible.
The first line of the input file contains the single integer number $n$ ($1 \le n \le 100~000$).
The second line of the input file contains n integer numbers – $a_i$ ($1 \le a_i \le i$).
The first line of the output file must contain Yes if the trading session with specified volumes is possibled and No otherwise. In the former case the second line must contain $n$ numbers – $b_i$.
4 1 2 3 4
Yes -1 1 1 -1
4 1 2 3 3
No
18 人解决，26 人已尝试。
27 份提交通过，共有 56 份提交。
4.8 EMB 奖励。