Taco Maximum Value

You are given an array of integers along with an integer n, which specifies the number of elements in the array. Your task is to determine the maximum possible value achievable by performing a series of allowed operations on these numbers. Upon careful analysis, you will find that the optimal strategy is to simply take the sum of all the elements in the array. Formally, for an array (a_1, a_2, \dots, a_n), the answer is given by (\sum_{i=1}^{n} a_i).

inputFormat

The input is given in two lines. The first line contains an integer n, denoting the number of elements in the array. The second line contains n space-separated integers, representing the elements of the array.

outputFormat

Output a single integer representing the maximum possible value obtained by summing all the array elements.## sample

5
4 3 -1 -3 1

4