Contest Duration: ~ (local time) (100 minutes) Back to Home

Time Limit: 2 sec / Memory Limit: 1024 MB

• 1 ≤ N ≤ 9
• N は整数である。

### 入力

N


### 入力例 1

2


### 出力例 1

8


### 入力例 2

1


### 出力例 2

1


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.