10761: ABC140 - A - Password
[Creator : ]
Description
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)?
How many possible passwords are there if each of its characters must be a digit between $1$ and $N$ (inclusive)?
Input
Input is given from Standard Input in the following format:
```
$N$
```
```
$N$
```
Output
Print the number of possible passwords.
Constraints
- $1 \leq N \leq 9$
- $N$ is an integer.
- $N$ is an integer.
Sample 1 Input
2
Sample 1 Output
8
There are eight possible passwords: 111
, 112
, 121
, 122
, 211
, 212
, 221
, and 222
.
Sample 2 Input
1
Sample 2 Output
1
There is only one possible password if you can only use one kind of character.