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: Runtime Error)

#include<stdio.h>
int main(void){
	int n,i,sum=0;
 	int ai[20],bi[20],ci[19];
	scanf("%d",&n);
  	for(i=0;i<n;i++){
      scanf("%d",&ai[i]);
    }
  	for(i=0;i<n;i++){
      scanf("%d",&bi[i]);
    }
  	for(i=0;i<n-1;i++){
      scanf("%d",&ci[i]);
   	}
	
  	for(i=0;i<n;i++){
      sum += bi[ai[i]-1];
      if(i>0 && ai[i]-ai[i-1]==1){
        sum += ci[ai[i]-2];
      }
    }
  
  	printf("%d\n",sum);
	return(0);
}