{"problem":{"name":"Non-decreasing","description":{"content":"Snuke has an integer sequence, $a$, of length $N$. The $i$\\-th element of $a$ ($1$\\-indexed) is $a_{i}$. He can perform the following operation any number of times: *   Operation: Choose integers $x$","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc086_b"},"statements":[{"statement_type":"Markdown","content":"Snuke has an integer sequence, $a$, of length $N$. The $i$\\-th element of $a$ ($1$\\-indexed) is $a_{i}$.\nHe can perform the following operation any number of times:\n\n*   Operation: Choose integers $x$ and $y$ between $1$ and $N$ (inclusive), and add $a_x$ to $a_y$.\n\nHe would like to perform this operation between $0$ and $2N$ times (inclusive) so that $a$ satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.\n\n*   Condition: $a_1 \\leq a_2 \\leq ... \\leq a_{N}$\n\n## Constraints\n\n*   $2 \\leq N \\leq 50$\n*   $-10^{6} \\leq a_i \\leq 10^{6}$\n*   All input values are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ $...$ $a_{N}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc086_b","tags":[],"sample_group":[["3\n-2 5 -1","2\n2 3\n3 3\n\n*   After the first operation, $a = (-2,5,4)$.\n*   After the second operation, $a = (-2,5,8)$, and the condition is now satisfied."],["2\n-1 -3","1\n2 1\n\n*   After the first operation, $a = (-4,-3)$ and the condition is now satisfied."],["5\n0 0 0 0 0","0\n\n*   The condition is satisfied already in the beginning."]],"created_at":"2026-03-03 11:01:13"}}