**Time limit:**1.00 s**Memory limit:**512 MB

They both read each book from beginning to end, and they cannot read a book at the same time. What is the minimum total time required?

**Input**

The first input line has an integer $n$: the number of books.

The second line has $n$ integers $t_1,t_2,\dots,t_n$: the time required to read each book.

**Output**

Print one integer: the minimum total time.

**Constraints**

- $1 \le n \le 2 \cdot 10^5$

- $1 \le t_i \le 10^9$

**Example**

Input:

`3`

2 8 3

Output:

`16`