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 C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace abc140
{
    class abc140c
    {
        static void Main(string[] args)
        {
            var n = int.Parse(Console.ReadLine());
            var b = Console.ReadLine().Split().ToList().ConvertAll(int.Parse);
            var r = Solve2(n, b);
            Console.WriteLine(r);
        }

        static int Solve(int n, List<int> b)
        {
            var c = b.Reverse<int>().ToList();
            var a = Enumerable.Repeat(999999,n).ToList();
            a[0] = c[0];
            for(var i =1; i != n-2; ++i) {
                a[i] = Math.Min(c[i-1], c[i]);
            }
            a[n - 2] = c[n - 2];
            a[n - 1] = c[n - 2];
            return a.Sum();
        }

        static int Solve2(int n, List<int> b)
        {
            var a = new List<int>();
            a.Add(b[0]);
            for(var i = 1; i != n-2; ++i) {
                a.Add(Math.Min(b[i - 1], b[i]));
            }
            a.Add(b[n - 1]);

            return a.Sum();
        }
    }
}