Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 1.0 Seconds Memory Limit: 65536K

Total Runs: 402 Accepted Runs: 226

As you may know from the comic "Asterix and the Chieftain's Shield", Gergovia
consists of one street, and every inhabitant of the city is a wine salesman. You
wonder how this economy works? Simple enough: everyone buys wine from other
inhabitants of the city. Every day each inhabitant decides how much wine he
wants to buy or sell. Interestingly, demand and supply is always the same, so
that each inhabitant gets what he wants.
### Input Specification

### Output Specification

For each test case print the minimum amount of work
units needed so that every inhabitant has his demand fulfilled. You may assume
that this number fits into a signed 64-bit integer (in C/C++ you can use the
data type "long long", in JAVA the data type "long").
### Sample Input

### Sample Output

There is one problem, however: Transporting wine from one house to another results in work. Since all wines are equally good, the inhabitants of Gergovia don't care which persons they are doing trade with, they are only interested in selling or buying a specific amount of wine. They are clever enough to figure out a way of trading so that the overall amount of work needed for transports is minimized.

In this problem you are asked to reconstruct the trading during one day in Gergovia. For simplicity we will assume that the houses are built along a straight line with equal distance between adjacent houses. Transporting one bottle of wine from one house to an adjacent house results in one unit of work.

The input consists of several test cases.

Each test case starts with the
number of inhabitants *n* (2 ≤ *n* ≤ 100000). The following line
contains *n* integers a_{i} (-1000 ≤ a_{i} ≤ 1000). If
a_{i} ≥ 0, it means that the inhabitant living in the i^{th}
house wants to buy a_{i} bottles of wine, otherwise if a_{i}
< 0, he wants to sell -a_{i} bottles of wine. You may assume that the
numbers a_{i} sum up to 0.

The last test case is followed by a line
containing 0.

5 5 -4 1 -3 1 6 -1000 -1000 -1000 1000 1000 1000 0

9 9000

Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz