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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<math.h>
#define MAX 9
int main(void){
  int i,j,k,l;
  scanf("%d",&i);
  if(1<=i && i<=9){
    if(i==1){
      printf("使える文字が1種類しか無い場合、パスワードは1種類しか設定出来ません。");
    }else {
      printf("%d\n",i*i*i);
      printf("設定出来るパスワードは");
      for(j=1;j<=i;j++){
        for(k=1;k<=i;k++){
          for(l=1;l<=i;l++){
            printf("'%d%d%d'",j,k,l);
          }
        }
      }
      printf("の%d種類です。",i*i*i);
    }
  }
}