소스 코드 제출

# def f() :
#     maxl=0
#     maxk=0
#     for i in range(0,len(a)) :
#         if a[i]%2!=0 :
#             if maxl<=a[i] :
#                 maxl=a[i]
#         elif a[i]%2==0 :
#             if maxk<=a[i] :
#                 maxk=a[i]
#     print(maxl+maxk)
#
#
# a = list(map(int,input().split()))
# f()

# def f(n) :
#     if n==0 :
#         return 0
#     return n%10+f(n//10)
#
# n = int(input())
# print(f(n))

# def f(n) :
#     if n<=2 :
#         return 1
#     return f(n-2)+f(n-1)
#
#
# n = int(input())
# print(f(n))

# def f(n) :
#     if n<=1 :
#         return n
#     return str(f(n//2))+str(n%2)
#
#
# n = int(input())
# print(f(n))

# def f(a,b) :
#     if
#
# a,b = map(int,input().split())
# for i in range(a,b+1) :
#
#     #i가 셀프넘버인지?
# print(f(a,b))