Pikule

Pikule are round, shiny marbles that children used to play with. Every pikule in our world has one integer written on it. When a pikule with value $Y$ is struck into a pikule with value $X$, the pikule with value $Y$ disappears and the struck pikule's value changes from $X$ to $X-Y$.

Dodo lined up $N$ pikules from left to right, numbered by position from $1$ to $N$. At the start, the pikule at position $i$ has the number $A_i$. The game goes as follows. In each step, Dodo picks one pikule at a position between $2$ and $N$ and pushes it to the left. The pikule keeps moving until it hits another pikule, and then the two merge as described above. After $N-1$ pushes, only the pikule at position $1$ remains.

Dodo loves big numbers. He wants to know the largest number that can remain on the last pikule, and the order in which he should push the pikules to reach it.

The first line contains a natural number $N$ ($1 \le N \le 10^5$).

The second line contains $N$ integers $A_1, \ldots, A_N$ ($-10^9 \le A_i \le 10^9$), the numbers on the pikules.

Print the number that remains on the final pikule on the first line.

On each of the next $N-1$ lines, print the position of the pikule Dodo pushes at step $i$. A pikule must already be at that position when it is pushed.

First sample: Dodo can only push the second pikule. Then the first pikule's value becomes $-1$, which is the final maximum.

Second sample: There are two possible push orders. In order {2, 3}, he first pushes the pikule at position 2, leaving 2 _ 1. Then he pushes position 3, leaving a single pikule with value 1. The better order is {3, 2}. After the first push the row is 3 0 _, and after the last push the remaining pikule has value 3, which is optimal.