import java.util.Scanner;

class Solver {
    void solve(Scanner sc) {
        int N = sc.nextInt();
        int[] B = new int[N + 1];
        B[0] = B[N] = Integer.MAX_VALUE;
        for (int i = 1; i < N; i++) {
            B[i] = sc.nextInt();
        }
        int sum = 0;
        for (int i = 0; i < B.length - 1; i++) {
            int limit = Math.min(B[i], B[i + 1]);
            sum += limit;
        }
        System.out.println(sum);
    }
}

class Main {
    public static void main(String... args) {
        Scanner in = new Scanner(System.in);

        new Solver().solve(in);

        in.close();
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz