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

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

def iinput():
    return int(input())

def finput():
    return float(input())

def tinput():
    return input().split()

def rinput():
    return map(int, tinput())

def rlinput():
    return list(rinput())

def pro(k, l, n):
    if l < n:
        if k == 0:
            return(n - l)
        return (n - l + 2)
    if l == n:
        if k == 0:
            return 0
        elif k == 1:
            return 1
        return 3
    else:
        l -= n - 1
        if l == k:
            return 1
        elif l > k:
            return 0
        if l < k - 1:
            return 2
        else:
            return 3
            

def rt(k, l , n):
    if k < n:
        if l == 0:
            return (k * 2 + n)
        return (n + k * 2 - 1)
    elif k == n:
        if l == 1:
            return (k * 3 - 2)
        elif l == 0:
            return (k * 3)
        return (k * 3 - 3)
    else:
        k -= n - 1
        if k == l:
            return (n * 3 - 2)
        elif k > l:
            return (n * 3)
        if k < l - 1:
            return ((n - 1) * 3 - 1)
        else:
            return ((n - 1) * 3)



def main():
    q = iinput()
    print(q ** 3)
    
    
    


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

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

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

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

print(num_of_password)

Solution (Python):

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

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

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

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

Solution (Python):
num = int(input())
if num == 1: 
  print(1)
else:
  print(num ** 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(pow(int(input()), 3))

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

print(N**3)

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

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

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

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

pasw = []
for i in range(n):
    for j in range(n):
        for k in range(n):
            pasw.append(100*i+10*j+k)

pasw = list(set(pasw))
print(len(pasw))

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

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

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

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

Solution (Python):



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


if __name__ == '__main__':
    main()

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

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

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

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

t = n*n*n
print(t)

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

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

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

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

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

Solution (Python):
from math import *
l=int(input())
c=1
for i in range(3):
	c=c*l
print(c)

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

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

ans = N

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

print ans

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

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

import sys
sys.setrecursionlimit(300000)


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

Solution (Python):
import itertools
n=input()
n=int(n)
if n>=1 and n<=9:
	li=[i for i in range(1,n+1)]
	li=li*3
	print(len(set(itertools.combinations(li,3))))
else:
  pass

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

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

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

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

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

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

Solution (Python):
N=int(input())
passward=110
iteration=0
for l in range(N):
    for m in range(N):
        for n in range(N):
            passward+=1
            iteration+=1
        passward-=N
        passward+=10
    passward-=10*N
    passward+=100
print(iteration)

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

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

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

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

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

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

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

Solution (Python):



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

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

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

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

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

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

Solution (Python):
import numpy as np
N=int(input())
print(N**3)

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

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

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

ans = n**3

print(ans)

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

print(N**3)

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    print(int(input()) ** 3)
if __name__ == '__main__':
    main()

Solution (Python):
def getN():
    return int(input())
  
n = getN()

print(n*n*n)

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

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

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

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

print(N**3)

Solution (Python):

input_int = int(input())




ans = 0

n = input_int
for number1 in range(1,n + 1):
	for number2 in range(1,n + 1):
		for number3 in range(1,n + 1):
			ans += 1



		

print(ans)

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

num = num**(3)

print(num)

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

numbers = n**3

print(numbers)

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

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

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

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

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

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

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

Solution (Python):
def solve(string):
    n = int(string)
    return str(n**3)


if __name__ == '__main__':
    print(solve(input()))

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

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

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

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

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

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

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

print(N**3)

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

print(N**3)

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

Solution (Python):


a = int(input())
if a == 1:
    print(1)
else:
    print(a**3)

Solution (Python):
v = input()

v = int(v)


print(v**3)

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

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

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

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

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

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

Solution (Python):

from sys import stdin

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

print(n**3)

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

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

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

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

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

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

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

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

"""
Created on Tue Sep 10 01:41:52 2019

"""

N = int(input())

print(N**3)

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

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

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

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

print(N**3)

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

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

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

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

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

ans = pow(n,3)

print(ans)

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

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

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

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

Solution (Python):
import sys

int = int(input())

print(int ** 3)

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

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

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

print(N*N*N)

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

Solution (Python):

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

Solution (Python):

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

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

print(n**3)

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

print(N * N * N)

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

Solution (Python):


MOD = 10 ** 9 + 7

N = int(input())

ans = N ** 3

print(ans)

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

Solution (Python):
'''
 Author: fuad Ashraful Mehmet
 University of Asia Pacific
 created :10 Sep 2019 7.33 PM
 Category :   from At Coder

 Problem:https:  
'''

 
 

num=int(input())


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

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

print(n**3)

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

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

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

Solution (Python):
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):
import math
N = int(input())
print('%d' % math.pow(N,3))

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

Solution (Python):
from sys import stdin

N = int(stdin.readline())
print(N*N*N)

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

print(t**3)

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

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

Solution (Python):

if __name__ == "__main__":
    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):
x = int(input())

print(x*x*x)

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

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

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

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


import sys

n = int(input())

print(n ** 3)

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

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

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

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

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

print(n**3)

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

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

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

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

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

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

Solution (Python):
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):
if __name__ == "__main__":
    nNum = int(input())
    print(pow(nNum, 3))

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

print (n**3)

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

print(n*n*n)

Solution (Python):


a = int(input())

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

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

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

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

input = sys.stdin.readline


def solve(n):
    return n ** 3


if __name__ == '__main__':
    n = int(input())

    answer = solve(n)
    print(answer)

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

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

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

print(N**3)

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

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

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

Solution (Python):
from itertools import product
n = int(input())
res = len(list(product([i for i in range(0, n)], repeat=3)))
print(res)

Solution (Python):
from itertools import product
n = int(input())
res = len(list(product([i for i in range(0, n)], repeat=3)))
print(res)

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

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

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
    read_all = [tuple(map(int, input().split())) for _ in range(N)]
    return map(list,zip(*read_all))



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

print(a ** 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):
import sys
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n = INT()
print(n**3)

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

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

Solution (Python):
import math

n = int(input())

print(pow(n,3))

Solution (Python):

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

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

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) 

def LI(): return list(map(int, sys.stdin.readline().split()))

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

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

Solution (Python):
import sys
from collections import deque
sys.setrecursionlimit(200000)
input = sys.stdin.readline

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

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

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

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

Solution (Python):
if __name__ == "__main__":
 
    n = int(input())
 
    print('{0}'.format(n**3))

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

ans = N ** 3

print(ans)

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

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

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

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

Solution (Python):
N = int(input())
lists  = []
pas = [0,0,0]
for i in range(1,N+1):
    pas[0] = i
    for j in range(1,N+1):
        pas[1] = j
        for k in range(1,N+1):
            pas[2] = k
            lists.append(pas)
print(len(lists))

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):
a = input()
a = int(a)
if 1 <= a <= 9:
    print(a * a * a)
else:
    print("number must be 1 ≤ N ≤ 9")

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

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

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

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

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

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

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

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

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

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

Solution (Python):

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


if __name__ == "__main__":
    main()

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


if __name__ == '__main__':
    slove()

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

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

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

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

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)


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

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

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

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

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

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

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

Solution (Python):


from collections import Counter,deque


from sys import stdin,setrecursionlimit


setrecursionlimit(10**6)
input=stdin.readline

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

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

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

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

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

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

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=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
from heapq import heappop, heappush
from operator import itemgetter
from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9 + 7
INF = float('inf')

def sol():
    N = int(input())

    ans = N**3
    print(ans)


sol()

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

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

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

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

Solution (Python):

def main():
    N = int(input())
    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):
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):
a = int(input())
s = pow(a,3)
print(s)

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

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

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

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

print(N*N*N)