Monk is outside a cave and there are rules to enter. Monk is given an array of integers

A. He has to find the sum of the integers in the array.

Step 1: The first line of the Input consists of a single integer N denoting the size of the array.

Step 2: The next line of Input consists of

N 'space separated integers' denoting the elements of this array.

The maximum size of the array can be

100. You need to find the sum of all the elements in the array and print it to output.

Help: How does Input works here?

SAMPLE INPUT

5

1 76 8 45 56

SAMPLE OUTPUT

186

help....