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 OCaml (4.02.3) (judge verdict: Accepted)

(* べき乗 *)
let rec ( ** ) a n =
  if n = 0 then 1
  else if n mod 2 = 1 then a * a ** (n - 1)
  else let t = a ** (n / 2) in t * t

let () =
  let n = Scanf.sscanf (input_line stdin) "%d" (fun a -> a) in
  let ans = n ** 3 in
  print_int ans;
  print_newline ()