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.



Sample input:
2


Sample output:
8

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import math
import os
import sys


DEBUG = 'DEBUG' in os.environ


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


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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
N = int(input())

print("{}".format(N**3))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())#waiting_for_pudging
print(n**3)#pudging
#accepted

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:

N = int(input())

print(N * N * N)

Submission status: Accepted

Solution code:
#問題文
#高橋君は3 桁のパスワードを設定しようとしています。
#使える文字が1 以上 N 以下の数字のみであるとき、設定できるパスワードが全部で何種類であるかを答えてください。

#制約
#1≤N≤9N は整数である。

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int):

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

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
i = int(input())

print(i ** 3)

Submission status: Accepted

Solution code:
import sys
for n in sys.stdin:
	n = int(n.split()[0])
	print(n ** 3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = n**3

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(raw_input())
print n ** 3

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(100000)

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

print(ii()**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
pw = N**3
print(pw)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

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

N = int(input())

print(N**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

b = a*a*a

print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())


A = n**3

print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())

print(num * num * num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
print(N**3);

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#Coding:Utf-8

N=int(input())

print(N**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math

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

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

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

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

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

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

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

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



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


main()

Submission status: Accepted

Solution code:
n = int(input())
print(n**3)
#1232141242141212414111412142141414124
#fwsfsffss

Submission status: Accepted

Solution code:
N = int(input())

print(pow(N, 3))

Submission status: Accepted

Solution code:
n = int(input())

print(pow(n, 3))

Submission status: Accepted

Solution code:
n = int(input())
print(n**3) #waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_waiting_for_pudging_

Submission status: Accepted

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

Submission status: Accepted

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

print(num_of_password)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
a=int(input())
print(a**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(pow(int(input()), 3))
#sssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssss

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
print(int(input()) ** 3)

Submission status: Accepted

Solution code:
# Coding:uft-8

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

Submission status: Accepted

Solution code:
# Coding:uft-8

n = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = int(input())
print(inp ** 3)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
#why 50 characters
t = n*n*n
print(t)

Submission status: Accepted

Solution code:
i = int(input())
print(str(i*i*i))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())
print(N * N * N)

Submission status: Accepted

Solution code:
#140a
print(int(input())**3)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
print(n**3)

Submission status: Accepted

Solution code:
N = input()

ans = N

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

print ans

Submission status: Accepted

Solution code:
N = int(input())

password = N ** 3
print(password)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(N ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(raw_input())

print n**3

Submission status: Accepted

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

n = int(input())
print(solve(n))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(n*n*n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a = int(input())
    if a == 1:
        print(1)
    else:
        print(pow(a, 3))

Submission status: Accepted

Solution code:
N = int(input())
if N == 1:
    print(1)
else:
    print(N**3)

Submission status: Accepted

Solution code:

input_int = int(input())
# print(input_int_list)
# print(input_int_list[1])
# print(input_int_list[2])

ans = 0

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



		

print(ans)

Submission status: Accepted

Solution code:
num = int(input())

num = num**(3)

print(num)

Submission status: Accepted

Solution code:
n = int(input())

numbers = n**3

print(numbers)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#a = list(map(int, input().split()))
#a = list(input())
a = int(input())
if a == 1:
    print(1)
else:
    print(a**3)

Submission status: Accepted

Solution code:
v = input()

v = int(v)


print(v**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

from sys import stdin

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

print(n**3)

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Tue Sep 10 01:41:52 2019

"""

N = int(input())

print(N**3)

Submission status: Accepted

Solution code:
num = int(input())
print(pow(num,3))

Submission status: Accepted

Solution code:

n = int(input())

print(n**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = pow(n,3)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
#l = 3
n = int(input())

print(n*n*n)

Submission status: Accepted

Solution code:
#140 a
N=int(input())
print(pow(N,3))

Submission status: Accepted

Solution code:
import sys

int = int(input())

print(int ** 3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 整数Nの入力
N = int(input())

# パスワードの種類の出力
print(pow(N, 3))

Submission status: Accepted

Solution code:
# -*- coding utf-8 -*-

MOD = 10 ** 9 + 7

N = int(input())

ans = N ** 3

print(ans)

Submission status: Accepted

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

 Problem:https:  
'''

 
 

num=int(input())


res=num**3

print(res)

Submission status: Accepted

Solution code:
def solve():
  n = int(input())
  print(n**3)
solve()

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

Solution code:
import math
N = int(input())
print('%d' % math.pow(N,3))

Submission status: Accepted

Solution code:
from sys import stdin

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

Submission status: Accepted

Solution code:
t = int(input())

print(t**3)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys

n = int(input())

print(n ** 3)

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    nNum = int(input())
    print(pow(nNum, 3))

Submission status: Accepted

Solution code:
n = int(input())

print (n**3)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# get a integer
a = int(input())
# output
print(str(a*a*a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def solve(n):
    return n ** 3


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

    answer = solve(n)
    print(answer)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

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

mod = 10**9 + 7

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

#################

N = I()
print(N**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n = INT()
print(n**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

n = int(input())

print(pow(n,3))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = N ** 3

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
a = int(a)
if 1 <= a <= 9:
    print(a * a * a)
else:
    print("number must be 1 ≤ N ≤ 9")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ =="__main__":                                                                                                                                                                               
	a = int(input())       
	print(a**3)

Submission status: Accepted

Solution code:
n=int(input())
if n == 1:
    print(1)
else:
    print(n**3)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
print("{}".format(n*n*n))

Submission status: Accepted

Solution code:
# ABC140A - Password
def main():
    N = int(input())
    ans = N ** 3
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
#import pysnooper
#import os,re,sys,operator,math,heapq,string
from collections import Counter,deque
#from operator import itemgetter
#from itertools import accumulate,combinations,groupby,combinations_with_replacement
from sys import stdin,setrecursionlimit
#from copy import deepcopy

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#abc140a

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

Submission status: Accepted

Solution code:
import sys
from heapq import heappop, heappush
from operator import itemgetter
from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9 + 7
INF = float('inf')

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

    ans = N**3
    print(ans)


sol()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

if n==1:
    print(1)
elif n!=0:
    print(n*n*n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
len = int(input())
print(len**3)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
N = int(input())
print(N * N * N)

Submission status: Accepted

Solution code:
N = int(input())
  
"""
result = 0
for i in range(N):
  for j in range(3):
    for z in range(N):
"""

print(N ** 3)

Submission status: Accepted

Solution code:
n = int(input())
print("{}".format(n**3))

Submission status: Accepted

Solution code:
import sys
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def main():


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








if __name__== "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = n * n * n

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

print(int(a)**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

sss = N**3
print(sss)

Submission status: Accepted

Solution code:
n =int(input())

print(n**3)

Submission status: Accepted

Solution code:
N = int(input())

print('{}'.format(N**3))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

N = int(input())

print(N*N*N)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
# 出力
print("{}".format(n**3))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

N = int(input())

ans = N**3
print(ans)