# ---
# jupyter:
#   jupytext:
#     text_representation:
#       extension: .py
#       format_name: light
#       format_version: '1.5'
#       jupytext_version: 1.14.4
#   kernelspec:
#     display_name: Python 3
#     language: python
#     name: python3
# ---

print("<NAME>")

r = int(input())
w = int(input())
h = int(input())
aoc = 3.14*r*r
poc = 2*3.14*r
aos = h*h
aor = w*h
print(aoc , " " ,poc , " " , aos , " " , aor)

c = int(input())
f = (c * 1.8) + 32
print(f)

i = int(input())
j = int(input())
k = int(input())
if i>k and i>j : 
    print("{} is greatest".format(i))
elif j>i and j>k:
    print("{} is greatest".format(j))
else :
    print("{} is greatest".format(k))

# +
import cmath
a = int(input())
b = int(input())
c = int(input())
d = (b**2) - (4*a*c)
s1= (-b-cmath.sqrt(d))/(2*a)
s2 = (-b+cmath.sqrt(d))/(2*a)

print("{0} and {1}".format(s1,s2))
# -

for i in range(65,127):
    print(i, " ",chr(i))

x = int(input())
fact = 1
for i in range(1,x+1):
    fact *= i
print(fact)

x = int(input())
y = int(input())
while(y):
    x,y = y,x%y
print(x)

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

num = int(input())
if num > 1:
    for i in range(2, num):
        if (num % i) == 0:
            print(num, "is not a prime")
            break
    else:
        print(num, "is a prime")
else:
    print(num, "is not a prime")

num = int(input())
s = 0
t = num
while temp > 0:
    d = t % 10
    s += d ** 3
    t //= 10
if num == s:
    print(num,"is an Armstrong number")
else:
    print(num,"is not an Armstrong number")  

for num in range(1, 1000 + 1):
    s = 0
    t = num
    while t > 0:
        d = t % 10
        s += d ** 3
        t //= 10

    if num == s:
        print(num)


def nas(num):
	return num == sum([int(x) ** len(str(num)) for x in str(num)])
num = int(input())
nas(num)


# +
def fibo(n):
    a = 0
    b = 1
    c = a+b
    print(0)
    print(1)
    while c<n:
        print(c)
        a = b
        b = c
        c = a+b

n = int(input())
fibo(n)


# -

def fibo(n):
    a = 0
    b = 1
    c = a+b
    if n == 1:
        return 0
    if n == 2:
        return 1
    else:
        while c<n :
            a = b
            b = c
            c = a+b
    return c
n = int(input())
fibo(n)

# +
# def fact(n):
#     fact = 1
#     for i in range(1,n+1):
#         fact *= i
#     return fact

# def strng(n):
#     s = n
#     ss = 0
#     for i in range(len(str(n))):
#         ss += fact(int(i))
#         print(i)
#    # return s == sum([fact(int(i)) for i in range(len(str(n)))])
# n = int(input())
# strng(n)
# -

sum1=0
num=int(input())
t=num
while(num):
    i=1
    f=1
    r=num%10
    while(i<=r):
        f=f*i
        i=i+1
    sum1=sum1+f
    num=num//10
if(sum1==t):
    print("strong number")
else:
    print("not strong number")

n = int(input())
print(str(n)[::-1])

n = int(input())
r = int(str(n)[::-1])
if n == r:
    print(f'{n} is a palindrome')
else:
    print(f'{n} is not pal')

x = int(input())
print(bin(x).replace("0b",""))
print(hex(x)[2:])

# +
l = []
n = int(input())
for i in range(1,n):
    x = int(input())
    l.append(x)

print(l)
# -

#

StarcoderdataJupyterScriptsDedupFiltered