Problem:
 Score : 100 points    Problem Statement Takahashi is going to set a 3 -character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?      Constraints  1 \leq N \leq 9  N is an integer.         Input Input is given from Standard Input in the following format:  N       Output Print the number of possible passwords.        Sample Input 1 2      Sample Output 1 8  There are eight possible passwords: 111 , 112 , 121 , 122 , 211 , 212 , 221 , and 222 .       Sample Input 2 1      Sample Output 2 1  There is only one possible password if you can only use one kind of character.

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

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

print(n ** 3)

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



res = n*n*n

print(res)

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

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

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

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

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

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

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

Solution (Python):
import sys

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


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


if __name__ == '__main__':
    solve()

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

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

print(N*N*N)

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

Solution (Python):
import sys
import decimal 

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

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

    
    
main()

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

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

Solution (Python):

import sys
input = sys.stdin.readline









N = int(input())

print(N**3)

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

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):
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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

if __name__ == '__main__':
    main()

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div

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

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

Solution (Python):

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

Solution (Python):
from sys import stdin, setrecursionlimit


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

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

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

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

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

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

print(n*n*n)

Solution (Python):
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

N = ri()

print(N**3)

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

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

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

Solution (Python):
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


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

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


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


if __name__ == '__main__':
    main()

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

print(n**3)

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

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

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

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

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

print(N**3)

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

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

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

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

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

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

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

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

Solution (Python):
def password(n):

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

if __name__ == '__main__':
    main()

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

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

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

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

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

print(N**3)

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

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

print(N**3)

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

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

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

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

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

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

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

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

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

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

Solution (Python):


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

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

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

y = x ** 3
print(y)

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

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

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

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

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

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

print(n*n*n)

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

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

print(N**3)

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

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

Solution (Python):
from itertools import combinations


N = int(input())
print(len(set(combinations([i for i in range(1, N + 1)] * 3, 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):
n = int(input())
print(n**3)

Solution (Python):
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:(input())

"""========main code==============="""
t=ii()
print(t*t*t)

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):
max = int(input())+1
result = 0

for i in range(1, max):
    for j in range(1, max):
        for k in range(1, max):
            result += 1


print(result)

Solution (Python):
a = int(input())
print(pow(a, 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())
t=0
a=1
while t<3:
    t+=1
    a*=n
print(a)

Solution (Python):
n=int(input())
t=0
a=1
while t<3:
    t+=1
    a*=n
print(a)

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

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

Solution (Python):
n = int(input())
answer = 1
for i in range(3):
  answer *= n
print(answer)

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

Solution (Python):
import math

print(int(math.pow(int(input()), 3)))

Solution (Python):


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

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

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

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

Solution (Python):
n = int(input())
a = []
for i in range(n):
	for j in range(n):
		for k in range(n):
			a.append(i+j+k)
			
print(len(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())
print(n*n*n)

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

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

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


if __name__ == '__main__':

    ABC_140_A()

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


if __name__ == '__main__':
    main()

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce


import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


n = I()
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):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()

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

def solve(N):
    ans = N**3
    return ans
print(solve(N))

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

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

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

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

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

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

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

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

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

if __name__ == "__main__":
    main()

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

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

print(N**3)

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

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

print(N*N*N)

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

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

ans = N ** 3
print(ans)

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

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

print(a**3)

Solution (Python):
a=int(input())
n=list(range(1,a+1))
m=n
o=n
count=0
for i in n:
  for j in m:
    for q in o:
        u=i,j,q
        count+=1
print(count)

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

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

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

Solution (Python):


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


main()

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

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

Solution (Python):

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

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

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

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

Solution (Python):
n = int(input())
print(n**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):
import os, sys, re, math

N = int(input())

print((N - 1 + 1) ** 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):
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime



def input1():
	return int(input())


def input2():
	return map(int,input().split())


def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets


def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	
	return fact(x+y)/fact(x)/fact(y)


def factorization(n):
	tmp=n
	count=0
	for i in range(2,int(n**0.5)+2):
		if tmp%i==0:
			cnt=0
			while tmp%i==0:
				cnt+=1
				tmp//=i
			count+=1
	if tmp!=1:
		count+=1

	return count
			




N=input1()

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("{} ".format(n*n*n))

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

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

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

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

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

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

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

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

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

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

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

ans = N**3
print(ans)

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

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

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

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

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

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

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

print(N ** 3)

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

print(N**3)

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

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

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

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

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys
from io import StringIO
import unittest

def resolve():
    n = int(input())

    print(n ** 3)

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """2"""
        output = """8"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """1"""
        output = """1"""
        self.assertIO(input, output)

if __name__ == "__main__":
    
    resolve()

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

Solution (Python):

N = int(input())


pass_syurui =N**3
print(pass_syurui)

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

Solution (Python):
n = int(input())
print(n**3)
'''
import itertools
a = []
for i in range(1,n+1):
    a.append(i)
l = list(itertools.product(a,repeat=3))

print(len(l))
print(l)
'''

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

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

if __name__ == "__main__":
	main()

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

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

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

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

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

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

Solution (Python):
import itertools
import math

n = int(input())


s =[]
for i in range(n):
    for j in range(n):
        for k in range(n):
            t= (i,j,k)
            s.append(t)
print(len(s))

Solution (Python):

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

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

print(a*a*a)

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, groupby
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
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):
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):
a = int(input())
print(a**3)

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

Solution (Python):


import sys


















def main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    n = ii()
    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(n**3)

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

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

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

print(n**3)

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

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

print(N**3)

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

print(N*N*N)

Solution (Python):
icase=0
if icase==0:
    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())
num = a ** 3
print(num)

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

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=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(n)**3) for n in input()]

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

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

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

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

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

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

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

print(num ** 3)

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

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

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


if __name__ == '__main__':
    q1()

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

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

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

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

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

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

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

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

print(N**3)

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

Solution (Python):

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

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
n=I()
print(n**3)

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

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

print(n ** 3)

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

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

print(N**3)

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

print(N*N*N)

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

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

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

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

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

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

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

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

answer = N ** 3

print(answer)

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