{"raw_statement":[{"iden":"problem statement","content":"You are given a sequence of length $N$, $A = (A_1, \\ldots, A_N)$, consisting of $1$ and $-1$.\nDetermine whether there is an integer sequence $x = (x_1, \\ldots, x_N)$ that satisfies all of the following conditions, and print one such sequence if it exists.\n\n*   $|x_i| \\leq 10^{12}$ for every $i$ ($1\\leq i\\leq N$).\n*   $x$ is strictly increasing. That is, $x_1 < \\cdots < x_N$.\n*   $\\sum_{i=1}^N A_ix_i = 0$."},{"iden":"constraints","content":"*   $1\\leq N\\leq 2\\times 10^5$\n*   $A_i \\in \\lbrace 1, -1\\rbrace$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"5\n-1 1 -1 -1 1"},{"iden":"sample output 1","content":"Yes\n-3 -1 4 5 7\n\nFor this output, we have $\\sum_{i=1}^NA_ix_i= -(-3) + (-1) - 4 - 5 + 7 = 0$."},{"iden":"sample input 2","content":"1\n-1"},{"iden":"sample output 2","content":"Yes\n0"},{"iden":"sample input 3","content":"2\n1 -1"},{"iden":"sample output 3","content":"No"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}