소스 코드 제출

'''
data type
정수
실수
문자
문자열     str
불린
'''


# s = input()
#
# print(s)
#
# print(len(s))
# print(s.upper())

'''
아스키코드 ( ASCII CODE ) : 모든 문자는 고유의 코드 넘버가 있다
American Standard Communication Information Interchange

'0' 48
'1' 49
..
'9'

' ' 32

'A' 65
'B' 66
'C' 67
...
'Z' 


'a' 97
'b' 98
...
'z'

'''

# a = input()
# print(chr (ord(a) + 3 ) )



# n=list(input())
# for i in range(len(n)):
#     sum=n[i]
#     if 97<=ord(sum)<=122 :
#         n[i]=chr(ord(sum)-3)
#         sum=n[i]
#         if ord(sum)<97 :
#             n[i]=chr(ord(sum)+26)
# for i in range(len(n)):
#     print(n[i],end='')

# n=list(input())
# for i in range(len(n)):
#     sum=n[i]
#     if 97<=ord(sum)<=122 :
#         n[i]=chr(ord(sum)+3)
#         sum=n[i]
#         if ord(sum)>122 :
#             n[i]=chr(ord(sum)-26)
# for i in range(len(n)):
#     print(n[i],end='')

'''
97<=소문자<=122
65<=대문자<=90
'''
# n=list(input())
# for i in range(len(n)):
#     sum = n[i]
#     if 97<=ord(sum)<=122 :
#         n[i]=chr(ord(sum)-32)
#     elif 65<=ord(sum)<=90 :
#         n[i]=chr(ord(sum)+32)
# for i in range(len(n)):
#     print(n[i],end='')

# n=list(input())
# c=0
# cc=0
# for i in range(len(n)):
#     if n[i]=='c' or n[i]=='C' :
#         c=c+1
# for i in range(len(n)-1):
#     if n[i]=='c' and n[i+1]=='c' :
#         cc=cc+1
#     if n[i]=='C' and n[i+1]=='c' :
#         cc=cc+1
#     if n[i]=='c' and n[i+1]=='C' :
#         cc=cc+1
#     if n[i]=='C' and n[i+1]=='C' :
#         cc=cc+1
# print(c)
# print(cc)

# n=[]
# for i in range(3):
#     n.append(list(input()))
# if n[0][len(n[0])-1]==n[1][0] and n[1][len(n[1])-1]==n[2][0] and n[2][len(n[2])-1]==n[0][0] :
#     print('good')
# else :
#     print('bad')

# a,b=map(int,input().split('x')))
# print(format((-b)/a,".2f"))

# n=list(input())
# a=''.join(n)
# n.reverse()
# b=''.join(n)
# c=int(a)+int(b)
# d=int(str(c)[::-1])
# if c==d :
#     print('YES')
# else :
#     print('NO')


# def grade(x) :
#     if 90<=x<=100 :
#         return 'A'
#     elif 80<=x<90 :
#         return 'B'
#     elif 70<=x<80 :
#         return 'C'
#     elif 60<=x<70 :
#         return 'D'
#     elif x<60 :
#         return 'F'
# n = int(input())
# print(grade(n))

# def 소수최소(x,y) :
#     mmin=0
#     for i in range(x,y+1):
#         a=0
#         for j in range(1,y+1):
#             if i%j==0 :
#                 a=a+1
#         if a==2:
#             mmin=i
#             break
#     return mmin
# def 소수더하기(a,b) :
#     d=0
#     for i in range(a,b+1):
#         c=0
#         for j in range(1,b+1):
#             if i%j==0:
#                 c=c+1
#         if c==2 :
#             d=d+i
#     return d
# M=int(input())
# N=int(input())
# if 소수최소(M,N)==10000 :
#     print(-1)
# else :
#     print(소수더하기(M,N))
#     print(소수최소(M,N))

# def 소수찾기(x) :
#     a=0
#     for i in range(1,x+1):
#         if x%i==0 :
#             a=a+1
#     if a==2 :
#         return 'prime'
#     else :
#         return 'composite'
# n=int(input())
# print(소수찾기(n))

# def 약수의개수(x) :
#     a=0
#     for i in range(1,x+1):
#         if x%i==0 :
#             a=a+1
#     return a
# n=int(input())
# print(약수의개수(n))

# def lower_bound(x,y) :
#     global ki
#     a=0
#     for i in range(x):
#         if ki[i]>=y :
#             a=i+1
#             break
#     if a==0 :
#         return x+1
#     else :
#         return a
# n=int(input())
# ki=list(map(int, input().split()))
# k=int(input())
# print(lower_bound(n,k))