Submit solution

Points:
10 (partial)

Time limit:
0.5s

Memory limit:
64M

Authors:

Problem type

Allowed languages

Assembly, Brain****, C, C++, Clang, Clang++, COBOL, Java, LOLCODE, Lua, NASM, NASM64, Text, Turing

Wlmojistan has begun to experience hyperinflation due to the increased amount of pp in the country (the weights aren't strong enough). As a side effect their national dish, dim sum, has begun to cost a fortune. Derek, however, still insists that he buys multiple dishes of dim sum. Given a list of the prices of dishes he ordered, help Dereck figure out the sum of all the prices of the dim sum dishes.

#### Input Specification

The first line of input will contain one integer \(N\), the number of dishes to follow, where \(1 \leq N \leq 20\).

The next \(N\) lines will each contain one number \(P\), the price of that dish, where \(P\) is a positive integer and has less than \(1000001\) digits.

#### Output Specification

Print out one number \(S\), the total sum of all the prices.

#### Sample Input

```
4
2
3
5
3
```

#### Sample Output

`13`

## Comments