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
input = sys.stdin.readline
from itertools import *
from collections import *

INF = float('inf')

""" Input
S = input().rstrip()
N, A, B = map(int, input().split())
A = list(map(int, input().split()))
D = [int(input()) for _ in range(N)]
"""

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

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

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

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

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

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

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

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

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

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

ans = n ** 3
print(ans)

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

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

ans = 0
for i in range(111, 1000):
    str_i = str(i)
    if str_i.count('0') != 0:
        continue

    for j in range(n+1, 10):
        if str_i.count(str(j)) != 0:
            break
    else:
        ans += 1

print(ans)

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

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

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

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

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


resolve()

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

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

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

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

Solution (Python):

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys

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

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

if __name__ ==  '__main__':
    main()

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

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

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

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

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

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

print(n**3)

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

print(n**3)

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

print(N**3)

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

print(n**3)

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

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

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

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

print(n ** 3)

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

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

if __name__ == '__main__':
    main()

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

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

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

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

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
























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

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

Solution (Python):
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

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

if n == 1:
    print(1)

else:
    print(n **3)

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

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

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

    print(N**3)


if __name__ == "__main__":
    main()

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

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

main()

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

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

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

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

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

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

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

Solution (Python):

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

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

    print(N**3)


if __name__ == '__main__':
    main()

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

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

Solution (Python):

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

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

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

Solution (Python):

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

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

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

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

answer = N * N * N

print(answer)

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

Solution (Python):

"""
A - Password
https://atcoder.jp/contests/abc140/tasks/abc140_a

"""
import sys


def solve(N):
    return N**3


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


if __name__ == '__main__':
    main(sys.argv[1:])

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

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

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

print(N**2*N)

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

ans = N**3
print(ans)

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

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

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

print(n**3)

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

print(n**3)

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

print(a*a*a)

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

Solution (Python):

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

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

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

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

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

Solution (Python):


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

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

print(n ** 3)

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

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

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

Solution (Python):


n = int(input())

print(n*n*n)

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

print(N * N * N)

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

print(a**3)

Solution (Python):

N = int(input())

print(N**3)

Solution (Python):
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):
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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





import numpy as np



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

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

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

Solution (Python):
def solve():
    N = int(input())
    return N * N * N

print(solve())

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

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

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

print(x*x*x)

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

print(N ** 3)

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

print(N ** 3)

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

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

print(n**3)

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

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

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

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

print(a**3)

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

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

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

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

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

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

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

print(N**3)

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

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

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

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

print(n * n * n)

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

print(N**3)

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

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

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

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

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

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

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

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

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

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



if __name__ == "__main__":
    resolve()

Solution (Python):

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

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

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

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

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

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

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

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

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

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

Solution (Python):

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

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

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

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

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

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

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

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

Solution (Python):
n = int(input())
cnt = []
for i in range(1, n + 1):
    for j in range(1, n + 1):
        for k in range(1, n + 1):
            s = str(i) + str(j) + str(k)
            if s not in cnt:
                cnt.append(s)

print(len(cnt))

Solution (Python):





import sys

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

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

Solution (Python):


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

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

Solution (Python):
class Solution:
    def solve(self, N: int) -> str:

        return N ** 3


if __name__ == '__main__':

    
    N = int(input())

    
    solution = Solution()
    print(solution.solve(N))

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

print(num*num*num)

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

ans = n*n*n
print(ans)

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

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

Solution (Python):



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

if __name__=='__main__':
  main()

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	N = II()
	print(N**3)

if __name__ == '__main__':
	main()

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

print(n**3)

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

Solution (Python):
import sys

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

def main():
    return n ** 3

if __name__ == '__main__':
    ans = main()
    print(ans)

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

cnt = 0

for i in range(N):
    for j in range(N):
        for k in range(N):
            cnt += 1

print(cnt)

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

print(N**3)

Solution (Python):


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

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

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)

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

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

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

Solution (Python):
import sys

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):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

print(N**3)

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

Solution (Python):
import sys

number = int(input())
answer = 1

for _ in range(3):
    answer *= number

print(answer)

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

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

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

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

Solution (Python):
print(pow(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 = 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):
import sys

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

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

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

print(n ** 3)

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

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

print(n**3)

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

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

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

Solution (Python):

import sys


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


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

if __name__ == '__main__':
    main()

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

print(N*N*N)

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

ans = []
for i in range(N):
  for j in range(N):
    for k in range(N):
      ans.append("{}{}{}".format(i,j,k))
		
print(len(ans))

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

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

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

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

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

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

Solution (Python):


n=int(input())


print(n**3)

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

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


def read_int(row):
    return int(row().rstrip())
  
N = read_int(row)
print(N ** 3)

Solution (Python):

import sys


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



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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
def solve(inp):
    N = int(inp.readline().strip())

    return str(N * N * N)


def test(s):
    from io import StringIO
    print(solve(StringIO(s)))


def main():
    import sys
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    
    main()

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

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

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

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

print(n**3)

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

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

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(int(pow(N,3)))

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):
print(int(input()) ** 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):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

    count = 0

    count = n ** 3

    print(count)

if __name__ == '__main__':
    main()

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

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

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

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

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

print( n**3 )

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

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

print(N**3)

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

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

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

print(n**3)

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

print(n ** 3)

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

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

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

print(n**3)

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

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

print(N ** 3)

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

Solution (Python):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

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

A=int(read())
print(A**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())
n = N ** 3
print(n)

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
if __name__ == "__main__":
    N = int(input())

    A = N**3

    print(A)

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

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

if __name__ == '__main__':
    main()

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

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

print(n*n*n)

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

print(N ** 3)

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

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