human
Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word.

Note, that during capitalization all the letters except the first one remains unchanged.

Input

A single line contains a non-empty word. This word consists of lowercase and uppercase English letters. The length of the word will not exceed 103.

Output

Output the given word after capitalization.

Examples

Input

ApPLe

Output

ApPLe

Input

konjac

Output

Konjac
The above is tricky. Write me a correct solution in PYTHON3.
 ... What is a the Python code you requested?
assistant
#Here is the Python code you requested.

# n = int(input())
# a = []
# m = []
# for i in range(n):
#     d,k = [int(i) for i in input().split()]
#     if k % d != 0:
#         a.append(k % d)
#     else:
#         pass
# a_set = set(a)
# most = None
# most1 = 0
# for i in a_set:
#     q = a.count(i)
#     if q >= most1:
#         most1 = q
#         most = i
#         m.append(i)
# b = -1
# for i in range(len(m)):
#     if m[i] > b:
#         b = a[i]
# print(b)

# n = int(input())
# s = input()
# k = 0
# flag = False
# def decode():
#     global s,k,flag
#     s1 = re.search(r'xxx',s)
#     if s1:
#         end = s1.end()
#         k += 1
#         s = s[end:]
#         flag = True
#         decode()
#     else:
#         pass
# decode()
# if flag:
#     print(k)
# else:
#     print(0)

# import time
# start_time = time.clock()
# a1 = []
# res = []
# a = None
# while a != 0:
#     a = int(input())
#     a1.append(a)
# for i in range(1,len(a1)):
#     for j in range(1,len(a1)):
#         if (a1[i-1] * a1[j-1]) % 7 == 0 and (a1[i-1] * a1[j-1]) % 49 != 0:
#             res.append(a1[i-1] * a1[j-1])
#         else:
#             pass
# print(max(res))
# print(time.clock() - start_time)

# n = int(input())
# i = 0
# k = []
# x = []
# y = []
# while i != n:
#     a,b = [int(i) for i in input().split()]
#     x.append(a)
#     y.append(b)
#     i += 1
# for i in range(n):
#     if x[i] >= 0 and y[i] >= 0:
#         k.append(1)
#     elif x[i] <= 0 and y[i] >= 0:
#         k.append(2)
#     elif x[i] <= 0 and y[i] <= 0:
#         k.append(3)
#     else:
#         k.append(4)
# k1 = {i: k.count(i) for i in set(k)}
# k1 = max(k1.items())
# print('K = ',k1[0])
# print('M = ',k1[1])

# import time
# t = time.clock()
# n = int(input())
# n1 = n
# a = []
#
# while n1 != 0:
#     a.append(int(input()))
#     n1 -= 1
# m = a[0] + a[7]
# for i in range(n-7):
#     if a[i] + a[i+7] > m:
#         m = a[i] + a[i+7]
# print(m)
# print(time.clock()-t)

# n = int(input())
# n1 = n
# x = []
# y = []
# s = []
# while n1 != 0:
#     a,b = [int(i) for i in...