Problem:
Score : 100 points

Problem Statement

Takahashi is going to set a 3-character password.

How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Constraints

1 \leq N \leq 9

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the number of possible passwords.

Sample Input 1

2

Sample Output 1

8

There are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.

Sample Input 2

1

Sample Output 2

1

There is only one possible password if you can only use one kind of character.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.Scanner;

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

		int N = sc.nextInt();

		int[] B = new int[N - 1];
		for (int i = 0; i < N - 1; i++) {
			B[i] = sc.nextInt();
		}

		// 例
		// B={2 3 4 8 4 5}
		// A={1 2 4 3 2 3 2}

		// 各要素が最大になるように、Aを作り、和を求めれば良い。
		// A_0とA_Nは例外だが、1<= i <=N-1については、
		// A_i=min(B_i-1, B_i)でよい

		int[] A = new int[N];

		A[0] = B[0];
		A[N - 1] = B[N - 2];

		for (int i = 1; i <= N - 2; i++) {
			A[i] = Math.min(B[i - 1], B[i]);
		}

		int ans = 0;

		for (int i = 0; i < N; i++) {
			ans += A[i];
		}

		System.out.println(ans);
	}

}