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())
ans = 0
ans = n*n*n
print(ans)

Solution (Python):
import numpy as np

N=int(input())

ans=N**3

print(ans)

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

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

Solution (Python):
from itertools import product

n = int(input())

print(len(list(product(list(range(1,n+1)), repeat=3))))

Solution (Python):

N = [int(s) for s in raw_input().split(" ")][0]
res = 1
for _ in xrange(3):
    res *= N
print(res)

Solution (Python):
from sys import stdin

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

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

sum = n*n*n

print(sum)

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

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

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

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

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

print(i ** 3)

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

print(N**3)

Solution (Python):
import sys
N=int(sys.stdin.readline().rstrip())
print(N**3)

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

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

n = pow(N, 3)
print(n)

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

Solution (Python):
import math
print (int(math.pow(int(input()), 3)))

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

print(N**3)

Solution (Python):

N = int(input())

print(N**3)

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left


INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LIM(): return list(map(lambda x:int(x) - 1, sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def LIRM(n): return [LIM() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
mod = 1000000007


n = I()
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())
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*n*n)

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):
from collections import Counter,defaultdict
import sys,heapq,bisect,math,itertools,string,queue
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def conb(n,r): return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


n = inp()
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())
ans=N**3
print(ans)

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

print(n**3)

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

print(n ** 3)

Solution (Python):


N = int(raw_input())

C = N*N*N

print(C)

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

print(N**3)

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

list_aaa=[]
cnt = 0

for i in range(1,N+1):
    for j in range(1,N+1):
        for k in range(1,N+1):
            list_aaa.append(str(i)+str(j)+str(k))
            cnt += 1

print(cnt)

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

Solution (Python):

from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n = ii()
    print(n**3)


main()

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

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

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

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

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

if n >= 1 and n <= 9:
    ans = n ** 3

print(ans)

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

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

Solution (Python):
N=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**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(str(a**3))

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

print(n ** 3)

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

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

print(M)

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())
y = x**3
print(y)

Solution (Python):



import sys, os
def ac_input(*args):
    return map(int, input().split())


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

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

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

Solution (Python):

N = int(input())
r = []
for i in range(1,N+1):
    for j in range(1,N+1):
        for k in range(1,N+1):
            r.append(str(i) + str(j) + str(k))


print(len(r))

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

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

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

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

print(N**3)

Solution (Python):
import sys; from collections import deque ; readline = sys.stdin.readline

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

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

ans = n*n*n
print(ans)

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

print(n**3)

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

print pow(N, 3)

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

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

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

    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
res = 0
for i in range(111, 1000):
    s = str(i)
    if '0' in s:
        continue
    flag = True
    for c in s:
        if not (1 <= int(c) <= n):
            flag = False
    if flag:
        res += 1
print(res)

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

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

print(N*N*N)

Solution (Python):
from itertools import accumulate
import sys

def main():
    input = sys.stdin.readline
    N = int(input())
    print(N**3)


if __name__ == '__main__':
    main()

Solution (Python):


N = int(input())

print(N ** 3)

Solution (Python):
def calc(n):
    return n*n*n


n = int(input())
r = calc(n)
print(r)

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

print(N*N*N)

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

Solution (Python):
n = int(input())
ans = 0
for i in range(1,n+1):
    for x in range(1, n+1):
        for z in range(1, n+1):
            ans += 1
print(ans)

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

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

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

print(n ** 3)

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

res=x**3

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

Solution (Python):


a = int(input())

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

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

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

main()

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

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

print(S**3)

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

ans = n ** 3

print(ans)

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

answer=N**3
print(answer)

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

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

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

Solution (Python):
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N] = [int(input_raw[0])]
    print N ** 3


if __name__ == '__main__':
    main()

Solution (Python):

 
N = int(input())

print(N * N * N)

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

Solution (Python):

import numpy as np
import sys


def main():
    N = int(input())
    ans = N *N *N
    print(ans)








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

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

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

print(n**3)

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

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

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

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

A = N*N*N
print(A)

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

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

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    n = int(lines[0])

    return (n,)


def solve(n):


    return n * n * n


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r)
    else:
        print("%s" % result)

if __name__ == '__main__':

    main()

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(pow(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(pow(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 = 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):
import sys
INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
sys.setrecursionlimit(10 ** 9)


def main():
    N = INT()

    print(N*N*N)


if __name__ == '__main__':
    main()

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

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

anc = N**3
print(anc)

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

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

Solution (Python):
import sys
import math
from fractions import gcd





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

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""


 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())


 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

N = int(sys.stdin.readline())

ans = N*N*N

print(ans)

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

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

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

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

Solution (Python):


import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    N = i2n()
    print(N**3)
    return

main()

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

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

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

print(n*n*n)

Solution (Python):
def solve():
    data = read()
    result = think(data)
    write(result)


def read():
    return read_int(1)[0]


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(data):
    return data ** 3


def write(result):
    print(result)


if __name__ == '__main__':
    
    
    
    
    solve()

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

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

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

Solution (Python):
'use strict'

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

print(n**3)

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

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

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

print(a**3)

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

print(N**3)

Solution (Python):
if __name__ == '__main__':
    a = int(input())
    if a == 1:
        print(1)
    else:
        print(pow(a, 3))

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

Solution (Python):
import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)




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


if __name__ == '__main__':
    main()

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

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

Solution (Python):


def main():
    S = int(input())
    Ans = S ** 3
    print(Ans)

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

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

a=a*a*a

print(a)

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

print(n*n*n)

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

Solution (Python):
n = int(input())
cnt = 0
for d3 in range(1, n + 1):
    for d2 in range(1, n + 1):
        for d1 in range(1, n + 1):
            cnt += 1
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*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=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*N*N)

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

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

Solution (Python):
import sys

def main():
    N = int(sys.stdin.readline())
    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):

import sys


def solve(N: int):
    print(N * N * N)
    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())
print(n ** 3)

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):
import sys

n=int(sys.stdin.readline())
print( n**3 )

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

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

Solution (Python):
while True:
    try:
        N = int(input())
        print(N**3)
    except EOFError:
        break

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

if n == 1:
    print(1)
else :
    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):
a=int(input())

print(a*a*a)

Solution (Python):
import itertools
N = int(input().split()[0])

p_gen = itertools.product(list(range(0, N)), repeat=3)
ans = len(list(p_gen))
print(ans)

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

print(N ** 3)

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

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

ans = N
for _ in range(2):
    ans *= N

print(ans)

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

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

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

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

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

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

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

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):
import sys

input = sys.stdin.readline

N = int(input().strip())

ans = N**3

print(ans)

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

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

print(n**3)

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
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 LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    n = I()
    print(n**3)
    return


def B():
    n = I()
    a = LI()
    b = LI()
    c = LI()
    ans = sum(b)
    for i in range(n-1):
        x = a[i]
        y = a[i+1]
        if y == x+1:
            ans += c[x-1]
    print(ans)
    return


def C():

    return


def D():

    return


def E():

    return


def F():

    return


if __name__ == "__main__":
    A()

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):
from sys import stdout
printn = lambda x: stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True 
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

n = inn()
print(n**3)

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

Solution (Python):

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

Solution (Python):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n = readi()

count = 0
for i in range(n):
    for j in range(n):
        for k in range(n):
            count += 1
print(count)

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

print(n**3)

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

Solution (Python):
import sys
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()

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

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

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

Solution (Python):
N = int(input())
a = N * N * N
print("{}".format(a))

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

ans = N**3

print(ans)

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

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

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

import sys

n = int(raw_input())




if n == 1:
    print 1
else:
    print n*n*n

Solution (Python):


import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

N = I()

print(N ** 3)

Solution (Python):
s = input()
S = int(s[0])

max = S ** 3
print(max)

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

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

print(pow(n,3))

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