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 JavaScript (node.js v5.12) (judge verdict: Runtime Error)

// inputに入力データ全体が入る
function Main(input) {
  // 1行目がinput[0], 2行目がinput[1], …に入る
  input = input.split();
switch(input){
 case 1:
  a = 1;
  break;

  case 2:
  a = 8;
  break;
  
   case 3:
  a = 27;
  break;

   case 4:
  a = 64;
  break;

   case 5:
  a = 125;
  break;

   case 6:
  a = 216;
  break;

   case 7:
  a = 343;
  break;

   case 8:
  a = 512;
  break;

   case 9:
  a = 729;
  break;


}
  //出力
  console.log(a);
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));