Given a list of integers, print their sum.

Input:
Each line will contain a int n (0 < n < 2000), followed by n integers (0 < f < 2^30). Input will terminate with a line containing a single '0'.

Output:
Output one line per test case, containing the sum. The sum will also be less than 2^30.

Input:
4 1 2 3 4
2 1 8
0

Output:
10
9