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 Fortran (gfortran v4.8.4) (judge verdict: Runtime Error)

program main
integer::n,i,k=0
integer, allocatable::a(:),b(:),c(:)
read*,n
allocate(a(n),b(n),c(n-1))
read*,a,b,c
do i=1,n
k=k+b(a(i))
if(a(i)==a(i-1)+1)then
k=k+c(a(i-1))
end if
end do
print*,k
end program main