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-----
2

-----Sample Output-----
8

There are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.

Difficulty: introductory

Starter code:

Solutions:
n = int(input())
print(n*n*n)

N = int(input())
print(N**3)

n=int(input())
print(n**3)

n = int(input())

print(n*n*n)

n=int(input())
print(n**3)

n = int(input())
print(n ** 3)

n=int(input())
print(n**3)

print((int(input()))**3)

n = int(input())
print(n**3)

print(int(input())**3)

print(int(input())**3)

N = int(input())
print(N**3)

n = int(input())
print(n**3)

n=int(input())
print(n**3)

n=int(input())
print(n**3)

N=int(input())

print(N**3)

N = int(input())
print(N**3)

n = int(input())
print(n**3)

print(int(input())**3)

n = int(input())
print(n**3)

print(int(input())**3)

n = int(input())
print((n**3))


N = int(input())
ans = N**3
print(ans)


N = int(input())

print(N**3)

n = int(input())
print(n*n*n)

print(int(input())**3)

n = int(input())
print(n**3)

N = int(input())
print(N**3)

n = int(input())

print(n * n * n)

def resolve():
    n = int(input())
    print(n**3)
resolve()

n = int(input())
print((n ** 3))


print(int(input())**3)

N = int(input())

print(N**3)

n=int(input())

print(n**3)

N = int(input())
print(N**3)

x = int(input())
print(x**3)

print((int(input())**3))


n = int(input())
print(n**3)

n=int(input())
print(n**3)

N = int(input())
print (N**3)

n = int(input())
print(n ** 3)

print(int(input())**3)

n = int(input())
print(n**3)

n=int(input())
print(n**3)

print(int(input())**3)

N=int(input())
print(N*N*N)

n = int(input())
print(int(n**3))

print(int(input())**3)

N = int(input())
print(N**3)

print(int(input())**3)

n = int(input())

print((n * n * n))


print(((int(input()))**3))


n=int(input())
print(n**3)

n=int(input())
print((n**3))


n=int(input())
print(n**3)

N = int(input())
print(pow(N,3))

n = int(input())
print(n**3)

n = int(input())
print(n**3)

N=int(input())
print((N**3))


n = int(input())

print(n**3)

N = int(input())
print(N**3)

n = int(input())
print(n ** 3)

n = int(input())
print(n * n * n)

n = int(input())

print(n ** 3)

print(int(input())**3)

print(int(input())**3)

print(int(input())**3)

N = int(input())
print(N ** 3)

print(int(input()) ** 3)

#from collections import deque
#from heapq import heapify, heappop, heappush
#from bisect import insort
#from math import gcd
#from decimal import Decimal
#mod = 1000000007
#mod = 998244353
N = int(input())
#N, K = map(int, input().split())
#A = list(map(int, input().split()))
#flag = True
#for k in range(N):
ans = N*N*N
print(ans)
#print('Yes')
#print('No')


n = int(input())
print((pow(n, 3)))


n=int(input())

a=n**3
print(a)

n = int(input())
print(n**3)

print(int(input())**3)

n = int(input())
print(n ** 3)

d = int(input())
print(d**3)

n = int(input())
print(n**3)

n=int(input())
print(n**3)

n = int(input())
print(int(n**3))

N = int(input())
print(N**3)

print((int(input()))**3)

N = int(input())
print(N**3)

print(int(input())**3)

N = int(input())
print(N**3)

print((int(input())**3))


n = int(input())
print(n**3)

#140-A

N = int(input())

print((N**3))


n=int(input())
print(n*n*n)

N = int(input())
print(N**3)

N = int(input())
print(N ** 3)

n=int(input())

print((n**3))


n=int(input())
print(n**3)

N=int(input())
print(N*N*N)

n=int(input())
print(n**3)

N = int(input())
print(N**3)

N = int(input())
print(N**3)

print(int(input())**3)

N = input()
n = int(N)
print(n**3)

N=int(input())
print(N**3)