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):
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 if N > 1 else 1)

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

Solution (Python):
n = int(input())
li = range(1,n+1)
le = len(li)
print(le ** 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(pow(int(input()),3))

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

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

Solution (Python):
n = int(input())
d1 = 1
d2 = 1
d3 = 1
password = [d1,d2,d3]
counter = 0
while d3 <= n and d2 <= n and d1 <= n:
    if d3 == n and d2 != n:
        d2 += 1
        d3 = 1
    elif d2 == n and d3 == n:
        d1 += 1
        d2 = 1
        d3 = 1
    else:
        d3 += 1
    password = [d1, d2, d3]
    counter += 1
print(counter)

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

import sys


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

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

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

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

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

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

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

ans = N ** 3

print(ans)

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

Solution (Python):
from math import pow

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(raw_input())
print N*N*N

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

print('%d' % (N ** 3))

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

Solution (Python):
N = int(input())
s = len(range(1, N+1))
print(s**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 ** 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):

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

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

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

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

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

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

res = n*n*n
print(res)

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

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

ans = tmp * tmp * tmp

print(ans)

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

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

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

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

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

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

Solution (Python):
from sys import stdin

N = int(stdin.readline())

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

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

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

print(N**3)

Solution (Python):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 




 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    ans = N**3
    print(ans)
    
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):
a=int(input())
print(a*a*a)

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

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

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

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

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

import sys
import math
import numpy as np


args = sys.argv
if len(args) == 2:
  from IPython import embed
  em = True
else:
  em = False


N = int(input())







if em: sys.stdin = open('/dev/tty')












print(N**3)

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

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

m = n**3

print(m)

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

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

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

Solution (Python):
def func(n):
    return n ** 3

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



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

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

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

X = (N)**3

print(X)

Solution (Python):


N = int(input())

print(pow(N,3))

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

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())
password = N * N * N
print(password)

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())
answer = a * a * a
print(answer)

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

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

Solution (Python):
if __name__ == '__main__':
    
    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())
print(n*n*n)

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

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

Solution (Python):


import sys,collections,itertools,re,math,fractions,decimal,random,array,bisect,heapq





def solve(f):
    n = f.read_int()
    return n**3


class Reader(object):
    def __init__(self, filename=None):
        self.file = open(filename) if filename is not None else None
        self.case = 1

    def __readline(self):
        return self.file.next().strip() if self.file else raw_input()

    def next_case(self):
        self.file.next()
        self.case += 1

    def read_int(self): return int(self.__readline())
    def read_float(self): return float(self.__readline())
    def read_long(self): return long(self.__readline())
    def read_decimal(self): return decimal.Decimal(self.__readline())
    def read_str(self): return self.__readline()

    def read_int_list(self): return map(int, self.__readline().split())
    def read_float_list(self): return map(float, self.__readline().split())
    def read_long_list(self): return map(long, self.__readline().split())
    def read_decimal_list(self): return map(decimal.Decimal, self.__readline().split())
    def read_str_list(self): return self.__readline().split()

if __name__ == '__main__':
    filename = sys.argv[1] if len(sys.argv) > 1 else None
    f = Reader(filename)
    if f.file:
        while True:
            print "Case 
            try:
                f.next_case()
            except StopIteration:
                break
    else:
        print solve(f)

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

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


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


def B():
    n = II()
    a = LI()
    b = LI()
    c = LI()
    ans = 0
    for i in range(n):
        ans += b[a[i] - 1] + (c[a[i] - 1] if i != n - 1 and a[i] + 1 == a[i + 1] else 0)
    print(ans)
    return


def C():
    n = II()
    b = LI()
    ans = b[0]
    for i in range(n-1):
        if b[i] >= b[i + 1]:
            ans += b[i + 1]
        else:
            ans += b[i]
    print(ans)
    return


def D():
    n, k = LI()
    s = S()
    a = []
    for i in range(n):
        if i == n - 1:
            a.append(s[i])
        elif s[i] != s[i + 1]:
            a.append(s[i])
    print(min(n - 1, n - len(a) + 2 * k))
    return


def E():
    return


def F():
    return



if __name__ == '__main__':
    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):
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**3)

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

Solution (Python):
N=input()
print(int(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):
from itertools import permutations

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




 
from collections import* 
from fractions import gcd
from functools import* 
from itertools import* 
from operator import mul,itemgetter
from bisect import* 
from heapq import* 
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)

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

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

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

print(N**3)

Solution (Python):
N=input()

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

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

b = pow(a,3);
print(b)

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):
import numpy as np

a = int(input())

a = a*a*a

print(a)

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

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

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

ans = int(0)

ans = N**3
print(ans)

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

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

print(n*n*n)

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

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

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

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

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

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

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

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

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

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

print(n**3)

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

i = N**3
print(i)

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

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

print(N**3)

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

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

Solution (Python):


a = int(input())

print("{}".format(a*a*a))

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

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

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

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

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

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

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

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

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

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

print(num ** 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())
a=N**3
print(a)

Solution (Python):
a=int(input())
if 1<=a and a<=9:
  print(a*a*a)

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

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


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

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

print(n**3)

Solution (Python):


import math
import os
import sys


DEBUG = 'DEBUG' in os.environ


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


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


def main():
    N = int(inp())
    print(N ** 3)


if __name__ == '__main__':
    main()

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


if __name__ == "__main__":
    main()

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


if __name__ == "__main__":
    main()

Solution (Python):


N = int(input())

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

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

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

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

Solution (Python):

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

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

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

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)

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

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







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

Solution (Python):

import sys


def solve(N: int):

    result_set = set()
    for i in range(1, N + 1):
        for j in range(1, N + 1):
            for k in range(1, N + 1):
                result = str(i) + str(j) + str(k)
                result_set.add(result)
    print(len(result_set))

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

print(i ** 3)

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

Solution (Python):
import sys
for n in sys.stdin:
	n = int(n.split()[0])
	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):
print(int(input())**3)

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

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

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

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

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

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

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

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

ans = n**3

print(ans)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    print(n ** 3)


if __name__ == '__main__':
    slove()

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

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

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

Solution (Python):
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

def main():
    N = INT()
    print(N * N * N)

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

result_set = set()
for i in range(1, n + 1):
    for j in range(1, n + 1):
        for k in range(1, n + 1):
            result = str(i) + str(j) + str(k)
            result_set.add(result)
print(len(result_set))

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

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

Solution (Python):
import sys
sys.setrecursionlimit(100000)

def ins(): return input().split()
def ii(): return int(input())
def iil(): return list(map(int,ins()))
def lin(): return list(input())
def iin(): return map(int,ins())

print(ii()**3)

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

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

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

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

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

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

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

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

Solution (Python):
import numpy as np


def main():
    n=int(input())
    print(pow(n,3))


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

sys.setrecursionlimit(5 * 10**5)
input=sys.stdin.readline

N = int(input())

print(N**3)

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

print(n*n*n)

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

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

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

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

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

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

print(N*N*N)

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

b = a*a*a

print(b)

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

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

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

Solution (Python):
import sys
a = []
for i in sys.stdin:
    print(int(i)**3)

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

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

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


A = n**3

print(A)

Solution (Python):
from sys import stdin
from math import factorial
n = int(stdin.readline().rstrip())
print(n**3)

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

print(num * num * num)

Solution (Python):
n=int(input())
ans=1
for i in range(3):
  ans*=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):
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=input()
print(N**3)

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

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

lst = [i for i in range(1, N + 1)]
cnt = 0
for x in lst:
  for y in lst:
    for z in lst:
      cnt += 1
print(cnt)

Solution (Python):


N=int(input())

print(N**3)

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