Problem:
Score : 300 points

Problem Statement

There is an integer sequence A of length N whose values are unknown.

Given is an integer sequence B of length N-1 which is known to satisfy the following:

B_i \geq \max(A_i, A_{i+1})

Find the maximum possible sum of the elements of A.

Constraints

All values in input are integers.

2 \leq N \leq 100

0 \leq B_i \leq 10^5

Input

Input is given from Standard Input in the following format:

N
B_1 B_2 ... B_{N-1}

Output

Print the maximum possible sum of the elements of A.

Sample Input 1

3
2 5

Sample Output 1

9

A can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.

Sample Input 2

2
3

Sample Output 2

6

Sample Input 3

6
0 153 10 10 23

Sample Output 3

53

Solution in Python (3.4.3) (judge verdict: Accepted)

#Nは数列の数
N=int(input())
#Bi=>max(Ai,Ai+1)を満たす
B = list(map(int, input().split()))
#数列Aは未知数
A = []

#Aの一個目はB[0]を挿入
A.append(B[0])

for i in range(1, len(B)):
    #(処理)
    A.append(min(B[i-1],B[i]))
    

#Aの一番最後はB[N-1]を挿入
A.append(B[N-2])
    


#結果を表示する
print(sum(A))