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

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

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

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

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

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

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

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

if n==1:
    print(1)
elif n!=0:
    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):
N = int(input())
print(N**3)

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

Solution (Python):
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

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

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

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

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

print(n**3)

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

Solution (Python):

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

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

Solution (Python):
N = int(input())
  
"""
result = 0
for i in range(N):
  for j in range(3):
    for z in range(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("{}".format(n**3))

Solution (Python):
import sys
import math

for line in sys.stdin:
  k = int(line)
  print((int)(math.pow(k, 3)))

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

print(N ** 3)

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

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

Solution (Python):
N = list(int(i) for i in input().split())[0]
print(N**3)

Solution (Python):


def main():


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








if __name__== "__main__":
    main()

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

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

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

print(N*N*N)

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

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

ans = n * n * n

print(ans)

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

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

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

Solution (Python):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

n = ni()

print(n**3)

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

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

print(n ** 3)

Solution (Python):
a = input()

print(int(a)**3)

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

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools, os, pdb
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def _pf(s): return print(s, flush=True)
def perr(s): return print(s, file=sys.stderr)

N = _I()

ans = (N)** 3
print(ans)

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

sss = N**3
print(sss)

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

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

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

print(n**3)

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

Solution (Python):
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*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):
import sys
sys.setrecursionlimit(int(1e6))

N = int(input())

ans = N**3
print(ans)

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

Solution (Python):
import sys


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



if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

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

print(N ** 3)

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

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

if N == 1:
  print(1)
else:
  ans = 1
  for i in range(3):
    ans = ans*N
  print(ans)

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

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

Solution (Python):
num = int(input())
print('{0}'.format(num ** 3))

Solution (Python):

n = int(input())

print(pow(n, 3))

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

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

Solution (Python):
N = int(input())
if N >= 1 and N <= 9:
  print(N**3)

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

print(i**3)

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

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

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

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

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

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

Solution (Python):


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

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

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

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

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

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

Solution (Python):

"""
3桁のパスワードを設定する。使える文字は1以上N以下の数値である。パスワードは３つの文字を独立して区別するので.
答えはN**3となる
"""
N=int(input())
print(N**3)

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

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

Solution (Python):
a = input("")
a = int(a)
b = 1
for i in range(3):
  b *= a
print(b)

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

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

Solution (Python):
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

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

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

print(n ** 3)

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

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

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

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

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

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

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

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

Solution (Python):
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
import math
import time
ts=time.time()
sys.setrecursionlimit(10**6)
def SI():
    return input().split()
def MI():
    return map(int,input().split())
def I():
    return int(input())
def LI():
    return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7

n=I()
print(n**3)

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

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

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

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


if __name__ == '__main__':
    a()

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

if N == 1:
  print(1)

else:
  Ans = N
  i = 1
  while 3 > i:
    Ans = Ans * N
    i += 1
  print(Ans)

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

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

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

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

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

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

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

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

ans = N **3

print(ans)

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

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

print(n ** 3)

Solution (Python):
N = input()
N = int(N)
if 1<=N and N<=9:
    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):
z =  [1, 2, 3, 4, 5, 6, 7, 8, 9]
while True:
    str_n = input()
    int_n = int(str_n)
    if int_n in z:
        break
print(pow(int_n,3))

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

print(N ** 3)

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

Solution (Python):
import sys

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

n = ni()
print(n**3)

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

Solution (Python):
N = input()

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

Solution (Python):
f = [1 for i in range(10)]
for i in range(2,10):
    f[i] = f[i-1] * i

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

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

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

print(t*t*t)

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

print(pow(a, 3))

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

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

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

print(N ** 3)

Solution (Python):
def A_Password():
    N =int(input())
    print(pow(N,3))
if __name__ == "__main__":
    A_Password()

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

ans = 0

ans = N **3

print(ans)

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

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

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

Solution (Python):

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

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

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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]
    print(II()**3)




if __name__ == '__main__':
    main()

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


def ans() :

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




if __name__ == '__main__':
    ans()

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

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

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

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

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

print(n ** 3)

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

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

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

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

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

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

Solution (Python):
import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
import numpy as np

sys.setrecursionlimit(10**8)

input = sys.stdin.readline

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


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
res = []
for k in range(1,n+1):
 for s in range(1,n+1):
  for b in range(1,n+1):
    
    resn = str(k) + str(s) + str(b)
    
    resn = int(resn)
    res.append(resn)
print(len(res))

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

print(N**3)

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

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

print(N * (N ** 2))

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 = 0

for i in range(1, n+1):
    for j in range(1, n+1):
        for k in range(1, n+1):
            ans += 1

print(ans)

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

aa = aiue*aiue*aiue

print(aa)

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

print(n ** 3)

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

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

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

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

print(pN)

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):
_ = int(input())
ans = 0
for i in range(_):
    for j in range(_):
        for k in range(_):
            ans += 1
print(str(ans))

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

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

print(N**3)

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

Solution (Python):

n = int(input())

print(n**3)

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

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

s = N*N*N

print(s)

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

print(N**3)

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):
N = int(input())
ans = N
for i in range(2):
    ans = ans * N
print ( ans )

Solution (Python):
n = int(input())
ans = 0
for i in range(n+1):
  for j in range(n+1):
    for k in range(n+1):
      if i!=0 and j!=0 and k!=0:
        ans+=1
print(ans)

Solution (Python):
n = input()

n = int(n)

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

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

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

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

out=n
for i in range(2):
    out*=n

print(out)

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

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

answer = N ** 3

print(answer)

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

l = []
for i in range(1, N + 1):
        for j in range(1, N + 1):
                for k in range(1, N + 1):
                     l.append("".join(str(i) + str(j) + str(k)))
print(len(l))

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

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

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

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

Solution (Python):
N = int(input())
print(N + N*(N-1)*3 + N*(N-1)*(N-2))

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

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

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

ans = 0
for i in range(N):
  for j in range(N):
    for k in range(N):
      ans += 1
print(ans)

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

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

Solution (Python):

import sys



import numpy as np



"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)

    def lcm(self, x, y):
        return (x * y) // self.gcd(x, y)


"""ここからメインコード"""


def make_divisors(n):
    
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            
            return i
            
            


def n_to_10(X, n):
    if int(X / n):
        return n_to_10(int(X / n), n) + str(X % n)
    return str(X % n)


def main():
    ip = IP()
    id = Idea()
    """この下から書いてね"""
    n = int(input())
    print(n ** 3)



main()

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

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


      

print(n*n*n)

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

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

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

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

import sys


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



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

if __name__ == '__main__':
    main()

Solution (Python):



from math import *
import os
import sys


import numpy as np



if __name__ == "__main__":
    
    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):
import sys
import itertools
n = int(sys.stdin.readline())
L = [i for i in range(1,n+1)]
a = list(itertools.product(L, repeat=3))
print(len(a))

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

print(N**3)

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

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





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

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

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

big_prime = 1000000007

"""


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


 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""
n=  int(sys.stdin.readline())
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**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*n*n)

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

Solution (Python):


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

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

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

Solution (Python):
N = input()

print pow(N,3)

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

Solution (Python):
from itertools import product

n = int(input())
l = list([i for i in range(1,n+1)])
ans = 0
for i in product(l , repeat=3):
    ans += 1
print(ans)

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

Solution (Python):

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

Solution (Python):

n = int(input())


print(n**3)

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

Solution (Python):
N = int(input())
pas = []
for i in range(1,N+1):
  for j in range(1,N+1):
    for k in range(1,N+1):
      pas.append(''.join([str(i),str(j),str(k)]))
print(len(set(pas)))

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

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

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

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

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

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

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

print(int(N**3))

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

Solution (Python):


digit = int(input())
print(digit * digit * digit)

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

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

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

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

ans = n**3

print(ans)

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

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

main()

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

Solution (Python):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque




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




if __name__ == '__main__':
    main()

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
from operator import itemgetter
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy
from collections import Counter, deque
import heapq
from functools import reduce
sys.setrecursionlimit(200000)





input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(*args, sep=" ", end="\n"): print("debug:", *args, file=sys.stderr, sep=sep, end=end) if not __debug__ else None
def exit(*arg): print(*arg); sys.exit()



def main():
    N = ii()
    print(pow(N, 3))
    return


if __name__ == '__main__':
    main()

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

n = int(input())

print(n**3)