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):
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):
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 ** 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())
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())
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*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**3)

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

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

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

print(n**3)

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

Solution (Python):







N = int(input())




ans = N*N*N
print(ans)

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):
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):
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):
n = int(input())
print(n**3)

Solution (Python):
d = int(input())
print(d**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):
print(int(input())**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):
n=int(input())
print(n**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*n*n)

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):
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**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**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):
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):
N = input()
n = int(N)
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):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    N = int(readline())

    print(N ** 3)


if __name__ == '__main__':
    main()

Solution (Python):
import sys


def main():
    input = sys.stdin.buffer.readline
    n = int(input())
    print(n * n * 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):
N = int(input())
O = N ** 3
print(O)

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

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

print(p*p*p)

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())

res = set()

for i in range(1, n + 1):
    for j in range(1, n + 1):
        for k in range(1, n + 1):
            res.add(str(i) + str(j) + str(k))

print(len(res))

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):
n = int(input())
cnt = 0
for i in range(1,n+1):
    for j in range(1,n+1):
        for k in range(1,n+1):
            cnt += 1
print(cnt)

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

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

a = N ** 3

print(a)

Solution (Python):


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

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

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

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

    ans = N ** 3

    print(ans)


if __name__ == "__main__":
    main()

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())
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):
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):

import sys
 
def solve(n):
    return n**3
 
if sys.argv[-1] == 'ONLINE_JUDGE':
    from numba.pycc import CC
 
    cc = CC('my_module')
    cc.export('solve', '(i8)')(solve)
    cc.compile()
    exit()
    
n=int(input())    
print(solve(n))

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

Solution (Python):
n = int(input())
x = n ** 3
print(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):
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):
print(int(input())**3)

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)

INF = 10**18
import bisect
import statistics
mod = 10**9+7


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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy








def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n = inp()
print(n ** 3)

Solution (Python):
print(int(input())**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):
a = int(input())
print(a**3)

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

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

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools










N = int(input())
ans= 0

print(N**3)

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

ans = n ** 3

print(ans)

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

Solution (Python):


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

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

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

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

cnt = 0
for _ in range(1, N+1):
    for _ in range(1, N+1):
        for _ in range(1, N+1):
            cnt += 1
print(cnt)

Solution (Python):
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    N=ii()
    print(N**3)



if __name__ == "__main__":
    main()

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):
a = int(input())
print(int(a ** 3))

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


if __name__ == "__main__":
    main()

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

for i in range(1, n+1):
    
    for j in range(1, n+1):
        
        for k in range(1, n+1):
            
            ans += 1
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):
from sys import stdin

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

print(x * x * x)

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):
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):
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):
N=int(input())
output=N*N*N
print(output)

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

print(N**3)

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

Solution (Python):

import itertools
n = int(input())
print(len(list(itertools.product(range(1,n+1), repeat=3))))

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    X = I()

    ans = X ** 3
    print(ans)

if __name__ == '__main__':
    resolve()

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):
n = int(input())
print(n**3)

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**3)

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

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

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 re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

a=k()
print(a**3)

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

Solution (Python):


def main():

    N = int(input())

    ans = N ** 3

    print(ans)


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**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):
print(int(input())**3)

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

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

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

Solution (Python):
import heapq
t = 1
def max(a,b):
	if a > b:
		return a
	return b
while t > 0:
	t -= 1
	
	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):







































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    N = int(lines[0])
    
    
    
    
    
    
    
    
    

    result = N**3

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['2']
        lines_export = [8]
    if pattern == 2:
        lines_input = ['1']
        lines_export = [1]
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



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):
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**3)

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

Solution (Python):
x=int(input())
print(x**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**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())
ans = N**3
print(ans)

Solution (Python):

import sys
import re
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor
sys.setrecursionlimit(1000000)


def main():
    input = sys.stdin.readline
    
    
    

    N = int(input())


    print(N ** 3)




if __name__ == '__main__':
    main()

Solution (Python):
def main() -> None:
    print(int(input()) ** 3)


if __name__ == '__main__':
    main()

Solution (Python):

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
N = int(input())
if not ( 1 <= N <= 9 ):sys.exit()

print(N**3)

Solution (Python):
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
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):
print(int(input())**3)

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

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

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

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

print(n ** 3)

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

Solution (Python):
import itertools
n = int(input())
p = []
for i in range(1, n+1):
    p.append(i)

print(len(list(itertools.product(p, repeat=3))))

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

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

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):
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):
def main():
 n = int(input())
 print(n * n * n)
main()

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):
def resolve():
    N = int(input())
    print(N**3)
    
if '__main__' == __name__:
    resolve()

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):
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):
line = int(input())
print(line * line * line)

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

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

print(r**3)

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

Solution (Python):
print(int(input())**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(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):
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):
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):
print(int(input())**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):
print(int(input())**3)

Solution (Python):
print(int(pow(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())
count = 0
for i in range(1,n+1):
    for j in range(1,n+1):
        for k in range(1,n+1):
            count+=1
print(count)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 9)




def input():
    return sys.stdin.readline().rstrip()


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 ** 3)

Solution (Python):
from itertools import *

N = int(input())
x = 1

N_list = [x+1 for x in range(N)]

n = list(product(N_list, repeat=3))

m = len(n)

print(m)

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

print(N*N*N)

Solution (Python):
N = input()
i=0
if int(N)<=9:
  i = int(N)*int(N)*int(N)
  print(i)

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(int(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**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):
n = int(input())
print(n ** 3)

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

Solution (Python):
print(int(input())**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):
print(int(input())**3)

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

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

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

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

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

if __name__ == '__main__':
    main()

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

if N == 1:
  print(N)
else:
  print(N*N*N)

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N = int(readline())
    print(N ** 3)
    return


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())
print(n ** 3)

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

print(n * n * n)

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

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

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

answer=N*N*N

print(answer)

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

print(answer)

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

print(n ** 3)

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

answer=N*N*N

print(answer)

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):
import sys, os, math, bisect, itertools, collections, heapq, queue

from decimal import Decimal
from collections import defaultdict



sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)


MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    print(N ** 3)


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())
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 * n * n)
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):
n = int(input())

print(n * n * n)

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

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

Solution (Python):

def main():
    n = int(input())
    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):
a = int(input())

print(a ** 3)

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

Solution (Python):


n = int(input())
num = 0

for i in range(1, n+1):
    for j in range(1, n+1):
        for k in range(1, n+1):
            num += 1

print(num)

Solution (Python):
def main():
    n = int(input())
    print(n**3)
    
if __name__ == '__main__':
    main()

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):
print(int(input())**3)

Solution (Python):
a=input()
A=float(a)
x=A.is_integer()
if 1<=A<=9 and x==True:
    N=int(A)
    print(N**3)

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

Solution (Python):



import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline




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

print(N*N*N)

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

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

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

if __name__ == '__main__':
    solve()

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):
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*N*N)

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

Solution (Python):
N = int(input())
print("{}".format(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):
n = int(input())
print(n**3)

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

Solution (Python):
import itertools
n = int(input())
l = list(itertools.product(range(1, n+1), repeat=3))
print(len(l))

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

print (x**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):
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):
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**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*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):
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):
print(int(input())**3)

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

print(s**3)

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

Solution (Python):
from sys import stdin

n = int(stdin.readline())
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*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)