## Inaho V

View as PDF

Points: 3 (partial)
Time limit: 0.2s
Memory limit: 64M

Authors:
Problem type

Inaho has arrived at the gates to return to his petty -dimensional world, but the gates are locked! He wants to get home as quickly as possible to continue playing his Graph Simulator 2015, that is within seconds, but the gates are preventing him from leaving. On the gates are nonpositive integers, and he believes finding the sum will allow him back into his -dimensional world. Of course, he is still stuck in the -dimensional hole, and therefore cannot comprehend the complexities of -dimensions, so he needs your help again.

#### Input Specification

The first line will contain the integer , the number of integers on the gates.

The second line will contain space-separated nonpositive integers, .

For 1 of the 3 available marks, .

#### Output Specification

Output the sum of the nonpositive integers.

#### Sample Input 1

2
-1 -4

#### Sample Output 1

-5

#### Sample Input 2

5
-4503599627370496 -4503599627370496 -4503599627370496 -4503599627370496 -4503599627370496

#### Sample Output 2

-22517998136852480