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: Accepted)

process.stdin.resume();
process.stdin.setEncoding('utf8');

var lines = [];
var reader = require('readline').createInterface({
    input: process.stdin,
    output: process.stdout
});
reader.on('line', (line) => {
    // ここで入力を処理する
    lines.push(line);
});
reader.on('close', () => {
    // ここで出力する
    for(var i =0; i<lines.length; i++){
      	switch(lines[i]){
 		case '1':
  			console.log(1);
  		break;

 		case '2':
  			console.log(8);
  		break;

   		case '3':
  			console.log(27);
  		break;

   		case '4':
  			console.log(64);
  		break;

   		case '5':
  			console.log(125);
  		break;

   		case '6':
  			console.log(216);
  		break;

   		case '7':
  			console.log(343);
  		break;

   		case '8':
  			console.log(512);
  		break;

   		case '9':
  			console.log(729);
  		break;
	}
    }
});