Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Artem and Array

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputArtem has an array of *n* positive integers. Artem decided to play with it. The game consists of *n* moves. Each move goes like this. Artem chooses some element of the array and removes it. For that, he gets *min*(*a*, *b*) points, where *a* and *b* are numbers that were adjacent with the removed number. If the number doesn't have an adjacent number to the left or right, Artem doesn't get any points.

After the element is removed, the two parts of the array glue together resulting in the new array that Artem continues playing with. Borya wondered what maximum total number of points Artem can get as he plays this game.

Input

The first line contains a single integer *n* (1 ≤ *n* ≤ 5·10^{5}) — the number of elements in the array. The next line contains *n* integers *a*_{i} (1 ≤ *a*_{i} ≤ 10^{6}) — the values of the array elements.

Output

In a single line print a single integer — the maximum number of points Artem can get.

Examples

Input

5

3 1 5 2 6

Output

11

Input

5

1 2 3 4 5

Output

6

Input

5

1 100 101 100 1

Output

102

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/29/2017 08:17:42 (p1).

Desktop version, switch to mobile version.
User lists

Name |
---|