V1
answers = [ 'd', 'b', 'd', 'a', 'd' ]
n = int(input())
print(answers[n-1].lower())

V2
import numpy as np
day=['Mon','Tue','Wed','Thu','Fri']
sales=[]
maxsale=-1
d=0
rates=np.array([int(e)for e in input().split()])
for i in range(4):
   sales.append([int(e)for e in input().split()])
sales=np.array(sales,float)
for i in range(len(sum(sales))):
   if sum(sales)[i]>maxsale:
      maxsale=sum(sales)[i]
      d=i
print (day[d],maxsale)
value=sales.T*rates
print(' '.join([str(e)for e in [sum(e)for e in value]]))

V3
import numpy as np
def read_height_weight():
   list_hw = []
   for k in range(int(input())) :
      h,w = input().split()
      list_hw.append((int(h),int(w)))
   return np.array(list_hw)
def cm_to_m(x):
   return x/100
def cal_bmi(hw):
   return hw[:,1]/(cm_to_m(hw[:,0])**2)
def main():
   hw = read_height_weight()
   bmi = cal_bmi(hw)
   avg_bmi = np.mean(bmi)
   count_underweight = len([e for e in bmi if e < 18.5])
   print('average bmi =', avg_bmi)
   print('#bmi < 18.5 =', count_underweight)
exec(input().strip())

V4
import numpy as np
def read_square_matrix():
 d = [int(e) for e in input().split()]
 m = [d]
 for k in range(len(d)-1):
    m.append([int(e) for e in input().split()])
 return np.array(m)
def min_in_each_row(m):
   return np.min(m,axis=1)
def max_in_each_column(m):
   return np.max(m.T,axis=1)
def diff_of_sums_of_two_diags(m):
   return abs(sum([m[i,i]-m[i,-(i+1)] for i in range(len(m))]))
def halve(m):
   for i in range(len(m)//2):
      for j in range(len(m)//2):
         m[i,j]=m[2*i,2*j]+m[2*i+1,2*j]+m[2*i,2*j+1]+m[2*i+1,2*j+1]
   return m[:len(m)//2,:len(m)//2]
exec(input().strip()) # do not remove this line

L1
answers = [ 'CE', 'AB', 'H', 'J', 'DHJMN' ]
n = int(input())
print(''.join(sorted(answers[n-1].upper())))

L2
def x(n):
   if n==0:return 0.01
   qwertyuiopasdfghjklzxcvbnm=x(n-1)
   return 3*qwertyuiopasdfghjklzxcvbnm*(1-qwertyuiopasdfghjklzxcvbnm)
def M(n):
   if n==0 or n==1: return 1
   return M(n-1)+sum([M(k)*M(n-2-k)for k in range(n-1)])
def D(m,n):
   if m==0 or n==0 :return 1
   return D(m-1,n)+D(m-1,n-1)+D(m,n-1)
def S(n):
   if n<=2:return 1
   return (((6*n-9)*S(n-1))-((n-3)*S(n-2)))//n
def d(n):
   if n==0:return 1
   return n*d(n-1)+(-1)**n
exec(input().strip())

L3
def dhanoi(n,left,mid,right):
 if n == 0 : return
 dhanoi(n-1,left,mid,right)
 print(str(n)+'W',':',left,'->',mid)
 print(str(n)+'B',':',left,'->',mid)
 dhanoi(n-1,right,mid,left)
 print(str(n)+'B',':',mid,'->',right)
 print(str(n)+'W',':',mid,'->',right)
 dhanoi(n-1,left,mid,right)
exec(input().strip())

L4
def copylist( x ):
   y=[]
   for e in x:
      if type(e) is list:
         y.append(copylist(e))
      else: y.append(e)
   return y
exec(input().strip())