Submit solution

Points:
10

Time limit:
3.0s

Memory limit:
64M

Author:

Problem types

Allowed languages

Brain****, C, C++, Clang, Clang++, Java, LOLCODE, Lua, Pascal, Perl, Python, Racket, Ruby, Text, Turing

Derek loves to eat dim sum, but it is always a hassle to figure out how much he is going to pay. Given a list of the prices of dishes he ordered, help Derek figure out the sum of all the dim sum dishes!

Derek also loves giving you unreasonable constraints, so he asks that your solution cannot contain any alphanumeric characters or quotation marks.

#### Input Specification

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

The next \(N\) lines will each contain one integer \(P\), the price of that dish.

#### Output Specification

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

#### Constraints

\(1 \le N \le 3000\)

\(0 \le P \le 100\)

#### Sample Input

```
4
2
3
5
3
```

#### Sample Output

`13`

## Comments