911 B | 911 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)
BLANK = " "
# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)
def solve():
s = ""
while 1:
try:
s2 = input()
except:
break
s += s2 + "\n"
s = s.lower()
ans = ""
chk = False
for i in s:
if i in ".!?":
chk = True
ans += i
elif 'a' <= i <= 'z':
if chk:
ans += i.upper()
chk = False
else:
ans += i
else:
if i not in " ()\n":
chk = False
ans += i
p(ans, end = "")
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()