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 (Python):
N = int(input())

print(N ** 3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):

a = int(input())

print(a*a*a)

Solution (Python):
n = int(input())
print (n*n*n)

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n=INT()
    print(n**3)
if __name__ == '__main__':
    do()

Solution (Python):
N = int(input())
print(N*N*N)

Solution (Python):
def main():
    N = int(input())
    print(N ** 3)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
n3 = n * n * n
print(n3)

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
print((int(input())**3))

Solution (Python):
n = int(input())
print(n*n*n)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
N=int(input())

print(N*N*N)

Solution (Python):
def f(N):
    return N**3
N=int(input())
print(f(N))

Solution (Python):
num = int(input())
print(num ** 3)

Solution (Python):
num = int(input())
print(num * num * num)

Solution (Python):
N = int(input())
print(N*N*N)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):
n = int(input())

print(n ** 3)

Solution (Python):
print(int(input())**3)

Solution (Python):
def main():
	
	
	n = int(input())
	
	
	
	
	
	print(int(n**3))


 
if __name__ == '__main__':
	main()

Solution (Python):
a=int(input())
print(a**3)

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
N = int(input())
a = N ** 3
print(a)

Solution (Python):
a=int(input())
print(a**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
n=int(input())
print(n*n*n)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
print((int(input()))**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
A = int(input())
print(A**3)

Solution (Python):
n = int(input())
print(pow(n,3))

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
N = int(input())
print(N * N * N)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):
N=int(input())
s=N*N*N
print(s)

Solution (Python):

 
import math
import itertools
import sys
import copy
 


N = int(input())

print (N**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
print(int(input())**3)

Solution (Python):


N = int(input())

print(N*N*N)

Solution (Python):
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res
def gcd(x, y):
    if x < y: x, y = y, x
    div = x % y
    while div != 0:
        x, y = y, div
        div = x % y
    return y

print(II()**3)

Solution (Python):
n = int(input())

def solve():
  print(n ** 3)

def main():
  solve()


if __name__ == "__main__":
  main()

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N=int(input().strip())
print(N**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
n=input()
print(int(n)*int(n)*int(n))

Solution (Python):
n=input()
print(int(n)*int(n)*int(n))

Solution (Python):

N = int(input())
ans = 0
for i in range(N):
	for j in range(N):
		for t in range(N):
			ans+=1
print(ans)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
a = int(input())
print(a**3)

Solution (Python):
a = int(input())
print(a**3)

Solution (Python):
var = int(input())

pas = var ** 3

print(pas)

Solution (Python):
a = int(input())
print(a*a*a)

Solution (Python):
a = input();
b = int(a)**3
print(b)

Solution (Python):
a = int(input())
b = a ** 3
print(b)

Solution (Python):
N = int(input())
 
print(N**3)

Solution (Python):
N = int(input())
S = N**3
print(S)

Solution (Python):
N = int(input())
 
print(N**3)

Solution (Python):

a = int(input())

s = a * a * a

print(s)

Solution (Python):
print(int(input())**3)

Solution (Python):

a = int(input())

b = a * a * a


print(b)

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
a = int(input())
print(a ** 3)

Solution (Python):


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

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
from sys import stdin

n = int(stdin.readline().rstrip())

print(n**3)

Solution (Python):
print(pow(int(input()), 3))

Solution (Python):
a=int(input())
print(a**3)

Solution (Python):
n=int(input())
print(n*n*n)

Solution (Python):
N=int(input())
if 1<=N<=9:
  print(N**3)

Solution (Python):
a=int(input())
print(a**3)

Solution (Python):
num=int(input())
print(num**3)

Solution (Python):
N = int(input())
print(N*N*N)

Solution (Python):
n = int(input())

if n == 1:
  print(1)
else:
  print(n**3)

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    print(int(input())**3)
resolve()

Solution (Python):
N = int( input() )
print( N ** 3 )

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
i = int(input())
print(i**3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
N = int(input())

print(N * N * N)

Solution (Python):
N = int(input())
a = N**3
print(a)

Solution (Python):
n = int(input())

print(n ** 3)

Solution (Python):
print("{}".format((int(input()))**3))

Solution (Python):
print(int(input())**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):



N = int(input())

print(N**3)

Solution (Python):
N=int(input())

print(N*N*N)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
n=int(input())

print(n**3)

Solution (Python):
n = int(input())
print(n * n * n)

Solution (Python):
a=int(input())
print(a**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):

n = int(input())


ans = n * n * n


print(ans)

Solution (Python):
print(int(input())**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    print(int(input()) ** 3)

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
print(N*N*N)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
num = int(input())
print(num**3)

Solution (Python):
a = int(input())
print(a ** 3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())

print(N*N*N)

Solution (Python):
n=int(input())
print(n*n*n)

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
s = int(input())

print(s**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):

import sys


def solve(N: int):
    print(N**3)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
a = n ** 3
print(a)

Solution (Python):
N=int(input())

print(N**3)

Solution (Python):
n = int(input())

ans = n**3
print(ans)

Solution (Python):
s=int(input())
print(s*s*s)

Solution (Python):

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

Solution (Python):
print(int(input())**3)

Solution (Python):

N = int(input())

print(N**3)

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
n = int(input())
print(n*n*n)

Solution (Python):
n=int(input()) 
print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
a=int(input())
print(a**3)

Solution (Python):
a=int(input())
count=0
for num in range(a):
    for num in range(a):
        for num in range(a):
            count+=1
print(count)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
N = int(input())

pattern = N ** 3
print(pattern)

Solution (Python):
N=int(input())
print(int(N**3))

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
N=int(input())

print(N**3)

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n=int(input())
a=0
for i in range(n):
    for j in range(n):
        for k in range(n):
            a+=1
print(a)

Solution (Python):
import itertools

n = int(input())

print(n**3)

Solution (Python):
a=int(input())
print(pow(a,3))

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
import itertools
a = int(input())
y = [x for x in range(1,a+1)]
print(len(list(itertools.product(y,repeat = 3))))

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
n = int(input())
print(n*n*n)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())
print(N * N * N)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n*n*n)

Solution (Python):
n=int(input())
print(n*n*n)

Solution (Python):
A = int(input())
print(str(A ** 3))

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n=int(input())
print(n*n*n)

Solution (Python):
N = int(input())

P = N * N * N

print(P)

Solution (Python):
N = int(input())
print(N*N*N)

Solution (Python):
import sys
input = sys.stdin.readline

n = int(input())

print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input()) 
print(N*N*N)

Solution (Python):
a=int(input())
print(a**3)

Solution (Python):
n = int(input())

print(n ** 3)

Solution (Python):
N =int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n*n*n)

Solution (Python):
print(int(input())**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
n = int(input())
print(int(n**3))

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n = int(input())

num = n**3
print(num)

Solution (Python):
print(int(input())**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):
N = int(input())
print(N*N*N)

Solution (Python):
N = int(input())
result = N*N*N
print(result)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n * n * n)

Solution (Python):
n = input()
e = int(n)
print(e*e*e)

Solution (Python):
n = int(input())
ans = 0
for a in range(n):
    for b in range(n):
        for c in range(n):
            total = str(a)+str(b)+str(c)
            ans += 1
print(ans)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
print((int(input()))**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
a = int(input())

print(a**3)

Solution (Python):
n = int(input())
print(n*n*n)

Solution (Python):
print(int(input())**3)

Solution (Python):
n=int(input())
x=n**3
print(x)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

p=input().rstrip()

print(int(p)**3)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

p=input().rstrip()
p=int(p)
print(p**3)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

p=int(input().rstrip())
print(p**3)

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
N=int(input())

print(N**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(N*N*N)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
a = int(input())
print(a * a * a);

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())

print(N*N*N)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())

ans = N ** 3
print(ans)

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
print(int(input())**3)

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve(N: int):
    return N * N * N


def main():
    N = int(input())
    print(solve(N))


if __name__ == '__main__':
    main()

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):

import sys







import re






def main():
    n = int(sys.stdin.readline().rstrip())
    print(n ** 3)
    
if __name__ == "__main__":
    main()

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = input()
N = int(N)

print(N ** 3)

Solution (Python):
a = int(input())
print(a**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
n=int(input())
print(n*n*n)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n=int(input())
print(n*n*n)

Solution (Python):
n=int(input())
print(n*n*n)

Solution (Python):
n=int(input())
s = 1
print(s*n*n*n)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
n = int(input())

cnt = 1

for i in range(3):
	cnt = cnt * n

print(cnt)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
N =int(input())
sum = N*N*N
print(sum)

Solution (Python):
N=int(input())
if 1<=N<=9:
    print(N**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n=int(input())
ans = n**3
print(ans)

Solution (Python):
n=int(input())
cnt=0
for i in range(n):
    for j in range(n):
        for k in range(n):
            cnt+=1

print(cnt)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
a = int(input())
print(a*a*a)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = input()

print(int(N) ** 3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(pow(N, 3))

Solution (Python):
N = int(input())
print(pow(N, 3))

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):

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

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
N = int(input())

result = N*N*N 

print(result)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
def main():
    N = int(input())
    print(N**3)

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())

print(N*N*N)

Solution (Python):
print(int(input())**3)

Solution (Python):
n = int(input())

print(n ** 3)

Solution (Python):
n = input()
print n ** 3

Solution (Python):
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]



def A():
    N = I()
    print(pow(N, 3))
    return



def B():
    return



def C():
    return



def D():
    return



def E():
    return



def F():
    return



def resolve():
    A()
    return



if __name__ == "__main__":
    A()

Solution (Python):
print(int(input())**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())
ans = N**3
print(ans)

Solution (Python):
print(int(input())**3)

Solution (Python):
n=int(input())

print(n**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n = int(input())
a = n * n * n
print(a)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n = int(input())
ans = n ** 3
print(ans)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
n = int(input())
print (n*n*n)

Solution (Python):
N=input()
print(int(N)**3)

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):
N = int(input())

ans = N ** 3
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
def print_ans(input_line):
    """Test Case
    >>> print_ans(2)
    8
    >>> print_ans(1)
    1
    """
    print(str(input_line ** 3))

if __name__ == '__main__':
    s = int(input().rstrip())
    print_ans(s)

Solution (Python):
print(int(input())**3)

Solution (Python):
a = int(input())
print(a*a*a)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
N=int(input())
print(N*N*N)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):

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

Solution (Python):
print(int(input()) ** 3)

Solution (Python):

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

Solution (Python):
n = int(input())

print(n ** 3)

Solution (Python):
a = int(input())
b = a**3
print(b)

Solution (Python):
n = input()
n = int(n)
print(n*n*n)

Solution (Python):
n = int(input())
if n >= 1 and n <= 9:
    print(n**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())

print(N*N*N)

Solution (Python):
n = int(input())

print(n*n*n)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
ans = N * N * N
print(ans)

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int( input() )
print( N**3 )

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
from enum import Enum
from queue import Queue

import numpy as np

import collections
import bisect
import sys
import math
import heapq

from scipy.sparse.csgraph import floyd_warshall

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

Solution (Python):
N = int(input())
print(N * N * N)

Solution (Python):
n = int(input())

ans = n ** 3
print(ans)

Solution (Python):
n = int(input())
if 1 <= n <= 9:
  print(n**3)

Solution (Python):

N = int(input())

print(N**3)

Solution (Python):
n = int(input().strip())

print(n * n * n)

Solution (Python):
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    print(n ** 3)


if __name__ == '__main__':
    solve()

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
N = int(input())
print(N*N*N)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
n = int(input())

s = n * n * n

print(s)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
n=int(input())

print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
a=int(input())
print(a**3)

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
print(int(input())**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
N = int(input())

if N == 1:
  print(1)
elif N == 2:
  print(8)
elif N == 3:
  print(27)
elif N == 4:
  print(64)
elif N == 5:
  print(125)
elif N == 6:
  print(216)
elif N == 7:
  print(343)
elif N == 8:
  print(512)
elif N == 9:
  print(729)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
N=int(input())
print(N*N*N)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
a=int(input())
b=a**3
print(b)

Solution (Python):
x = input()
a = int(x)

print(a*a*a)

Solution (Python):
N = input()
N = int(N)
print(N * N * N)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = input()
N = int(N)
print(N**3)

Solution (Python):
n = int(input())
print(n*n*n)

Solution (Python):
N = int(input())
ans = N**3
print(ans)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
n = int(input())
print(n*n*n)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
N = int(input())

print(N*N*N)

Solution (Python):
n = int(input())
ans = n ** 3
print(ans)

Solution (Python):
print(int(input())**3)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
N=int(input())
print(pow(N,3))

Solution (Python):
a, = map(int, input().split())
password = a ** 3
print(password)

Solution (Python):
str = input()
ans = int(str) ** 3
print(ans)

Solution (Python):
n = int(input());print(n ** 3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
a=int(input())
print(a*a*a)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
a=int(input())
print(a**3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
N=input()
n=int(N)
for n_ in range (n):
    n_=n**3
print(n_)

Solution (Python):
n=int(input())
print(n*n*n)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):
N=int(input())

print(N**3)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
N = input()
N = int(N)
answer = N*N*N
print(answer)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
N = int(input())
result = N**3
print(result)

Solution (Python):


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

Solution (Python):
n=int(input())
ans=0
for i in range(n):
  for j in range(n):
    for k in range(n):
      ans += 1
      
print(ans)

Solution (Python):
def main():

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




if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())

print(n * n * n)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
import itertools
n = int(input())
print(n**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())
ans = N ** 3
print(ans)

Solution (Python):
print(int(input())**3)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
x = int(input())
print(x*x*x)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):

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

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
n = int(input())



print(n ** 3)

Solution (Python):
N = int(input())
print(N*N*N)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())
print(N*N*N)

Solution (Python):
N = int(input())
total = 0
if N == 1:
    total += 1
else:
    for i in range(1,N+1):
        for j in range(1,N+1):
            for k in range(1,N+1):
                total += 1
print(total)

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):

N = int(input())

print(N ** 3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = input()
N = int(N)

number = N*N*N
print(number)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
n = int(input())

print(n**3)

Solution (Python):
a = int(input())

print(a*a*a)

Solution (Python):
print(int(input())**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N = int(input())


def solve(N):
    return N ** 3


print(solve(N))

Solution (Python):
print(int(input())**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
N = int(input())
result = N **3
print(result)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N = int(input())

print(N ** 3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
if __name__ == '__main__':
  N = int(input())
  print(N**3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
"""
author : halo2halo
date : 18,Oct,2019
"""

import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

N = int(readline().rstrip())
print(N**3)

Solution (Python):
N = int(input())

ans = N ** 3

print(ans)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
N =int(input())
print(N*N*N)

Solution (Python):
import os

def main():

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


if __name__ == "__main__":
    main()

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):
a = int(input())
print(a*a*a)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
N = int(input())
print(N**3)

Solution (Python):
N=int(input())
print(N**3)

Solution (Python):
N = int(input())
result = N*N*N
print(result)

Solution (Python):
from math import *

n = int(input())

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

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
import math
i = int(input())
if i==1:
  print(1)
else:
  print(pow(i,3))

Solution (Python):
N = int(input())
print(N ** 3)

Solution (Python):

N = int(input())


print(pow(N, 3))

Solution (Python):
N = int(input())

print(N**3)

Solution (Python):
n = int(input())
print(n ** 3)

Solution (Python):
print(int(input())**3)

Solution (Python):
import sys
N=int(input())

print(pow(N,3))

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
M = int(input())
print(M*M*M)

Solution (Python):
n = int(input())
print(n**3)

Solution (Python):
print(int(input())**3)

Solution (Python):
def main():
    n = int(input())

    print(n*n*n)


if __name__ == '__main__':
    main()

Solution (Python):
i = int(input())

print(i**3)

Solution (Python):
print(int(input()) ** 3)

Solution (Python):
n=int(input())
print(n**3)

Solution (Python):
n=int(input())
print(n**3)