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 Ruby (2.7.1) (judge verdict: Accepted)

n = gets.chomp.to_i
i = 1
pass = []
while i <= n
  j = 1
  while j <= n
    k = 1
    while k <= n
      pass << [i,j,k].join
      k+=1
    end
    j+=1
  end
  i+=1
end
p pass.size