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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        List<Integer> numsListA = new ArrayList<Integer>();
        List<Integer> numsListB = new ArrayList<Integer>();
        List<Integer> numsListC = new ArrayList<Integer>();
        int score = 0;

        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();                     //N品の料理を食べる
        for(int i = 0; i < n; i++) {                //N回scanします ListA
            numsListA.add(scan.nextInt());
        }
        for(int i = 0; i < n; i++) {                //N回scanします ListB
            numsListB.add(scan.nextInt());
        }
        for(int i = 0; i < n - 1; i++) {            //N-1回scanします ListC
            numsListC.add(scan.nextInt());
        }

        for (int i = 0; i < n; i++) {               //ListB満足度をscoreにSUM
            score += numsListB.get(numsListA.get(i) - 1);
        }

        for (int i = 0; i < n - 1; i++) {           //ListCボーナスをscoreにSUM
            if(numsListA.get(i + 1) - numsListA.get(i) == 1) {
                score += numsListC.get(numsListA.get(i)- 1);
            }
        }

        System.out.println(score);
    }
}