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 PHP7 (7.0.15) (judge verdict: Accepted)

<?php
//https://atcoder.jp/contests/abc139/submissions/7295556
//error_reporting(0);
$N = trim(fgets(STDIN));
//list($A,$B) =  explode(" ",trim(fgets(STDIN)));
//$H = explode(" ",trim(fgets(STDIN)));


for($i=0;$i<$N;$i++) {
 for($j=0;$j<$N;$j++) {
   for($k=0;$k<$N;$k++) {
     $res[]=$i.$j.$k;
   }
 }
}
printf("%d\n",count($res));