Maximum Energy Drink Supply

In this problem, you are given a sequence of checkpoints where each checkpoint provides a certain number of energy drinks. The runner collects energy drinks from every checkpoint. The goal is to compute the maximum energy drink supply by summing all the values provided.

The mathematical formulation can be represented as: $$S = \sum_{i=1}^{n} a_i,$$ where $$n$$ is the number of checkpoints and $$a_i$$ is the energy drink supply at the i-th checkpoint.

inputFormat

The input is given through standard input (stdin). The first line contains an integer $$n$$ representing the number of checkpoints. The second line contains $$n$$ space-separated integers, where each integer corresponds to the energy drink supply at a checkpoint.

outputFormat

Output a single integer to standard output (stdout) representing the total energy drink supply collected.

5
5 10 15 20 25

75