UVA11054WiningTradingInGergovia

//UVA11054WiningTradingInGergovia
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
//就像是借钱和还钱一样的，殊途同归 
const int MAXN = 1e6 + 10;
int a[MAXN], tmp_a[MAXN];
int main() {
	int n;
	while(scanf("%d", &n) == 1 && n) {
		for(int i = 0; i < n; i++) scanf("%d", &a[i]);
		tmp_a[0] = a[0];
		for(int i = 1; i < n; i++) 
			tmp_a[i] = tmp_a[i - 1] + a[i];
		long long cnt = 0;
		//for(int i = 0; i < n; i++) printf("%2d", tmp_a[i]);
		//printf("\n");
		for(int i = 0; i < n; i++) cnt += abs(tmp_a[i]);
		printf("%lld\n", cnt); 
	}
	return 0;
} 
/*
5
5 -4 1 -3 1
6
-1000 -1000 -1000 1000 1000 1000
0
*/