Problem:
Toggling Cases Write a program which converts uppercase/lowercase letters to lowercase/uppercase for a given string. Input A string is given in a line. Output Print the converted string in a line. Note that you do not need to convert any characters other than alphabetical letters. Constraints  The length of the input string < 1200  Sample Input fAIR, LATER, OCCASIONALLY CLOUDY. Sample Output Fair, later, occasionally cloudy.

Solution (Python):
letters=input()
print(letters.swapcase())

Solution (Python):
a=input()
b=a.upper()
c=a.lower()
ans=""
for i,j,k in zip(a,b,c):
    if i==j and j==k:
        ans+=i
    elif i==j:
        ans+=k
    else:
        ans+=j
print(ans)

Solution (Python):
line = input()

result = ''

for char in line:
    if char.isupper():
        char = char.lower()
    elif char.islower():
        char = char.upper()
    result += char

print(result)

Solution (Python):
t = input()
print(t.swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
x = input()
for i in x:
    if i.islower():
        print(i.upper(), end='')
    else:
        print(i.lower(), end='')
print()

Solution (Python):
print(input().swapcase())

Solution (Python):
import re


words = list(input().split(' '))


new = []
for word in words:
    new_word = ''
    for ch in word:
        if re.match('[a-z]', ch):
            new_word = new_word + ch.upper()
        elif re.match('[A-Z]', ch):
            new_word = new_word + ch.lower()
        else:
            new_word = new_word + ch
    new.append(new_word)


for i in range(len(new)-1):
    print(new[i], end=' ')
print(new[-1])

Solution (Python):
print(input().swapcase())

Solution (Python):
import string
strings = list(input())
uppers = string.ascii_uppercase
lowers = string.ascii_lowercase

for i in range(len(strings)):
    if strings[i] in uppers:
        strings[i] = str.lower(strings[i])
    elif strings[i] in lowers:
        strings[i] = str.upper(strings[i])

print(''.join(map(str, strings)))

Solution (Python):
s = list(input())
for i in range(len(s)):
    s[i] = s[i].upper() if s[i].islower() else s[i].lower()
print("".join(s))

Solution (Python):
A = input()
ans = ''

for i in A:
    if i.isupper() == True:
        ans += i.lower()
    else:
        ans += i.upper()

print(ans)

Solution (Python):
n = str(input())
print(n.swapcase())

Solution (Python):
alphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'
dic = {c: alphabet[(i + 26) % 52] for i, c in enumerate(alphabet)}

s = input()
for c in s:
    if c in alphabet:
        print(dic[c], end='')
    else:
        print(c, end='')

print()

Solution (Python):
s=input()
print(s.swapcase())

Solution (Python):
for c in list(input()):
    if str.isupper(c):
        print(str.lower(c),end='')
    elif str.islower(c):
        print(str.upper(c),end='')
    else:
        print(c,end='')
print()

Solution (Python):
s =input()
print(s.swapcase())

Solution (Python):
txt = input()
ans = ''

for t in txt:
    if t.isupper():
        ans += t.lower()
    elif t.islower():
        ans += t.upper()
    else:
        ans += t

print(ans)

Solution (Python):
a=print(str.swapcase(input()))

Solution (Python):
print(input().swapcase())

Solution (Python):
ins=input()
l=len(ins)

ans=""
for i in range(l):
    oi = ord(ins[i])
    if oi>=65 and oi<=90:
        oo = oi + 32
    elif oi>=97 and oi<=122:
        oo = oi -32
    else:
        oo = oi
    ans = ans + chr(oo)
print(ans)

Solution (Python):
line = input()

new = ""
for i in range(len(line)):
    if line[i].islower():
        new += line[i].upper()
    elif line[i].isupper():
        new += line[i].lower()
    else:
        new += line[i]

print(new)

Solution (Python):
print(str.swapcase(input()))

Solution (Python):
s = input()
print(s.swapcase())

Solution (Python):
a=list(input())
for x in a:
	if ord(x) >= 97 and ord(x) <=123:
		x=chr(ord(x)-32)
	elif ord(x) >= 65 and ord(x) <=91:
		x=chr(ord(x)+32)
	print(x,end="")
print()

Solution (Python):
def test():

	string = list(input())

	for i in range(len(string)):

		
		if ord('a') <= ord(string[i]) and ord(string[i]) <= ord('z'):
			string[i] = chr(ord(string[i]) - 0x20)
		
		elif ord('A') <= ord(string[i]) and ord(string[i]) <= ord('Z'):
			string[i] = chr(ord(string[i]) + 0x20)

	print(''.join(string))

if __name__ == "__main__":
	test()

Solution (Python):
print(input().swapcase())

Solution (Python):
input_str = input()
print(input_str.swapcase())

Solution (Python):
n = str(input())
print(n.swapcase())

Solution (Python):
str = input()
print(str.swapcase())

Solution (Python):
a=list(input())
for x in a:
	if ord(x) >= 97 and ord(x) <=123:
		x=chr(ord(x)-32)
	elif ord(x) >= 65 and ord(x) <=91:
		x=chr(ord(x)+32)
	print(x,end="")
print()

Solution (Python):
fair = input()
ans =''

for i in fair:
    if i == i.lower():
        ans += i.upper()
    else:
        ans += i.lower()
    
print(ans)

Solution (Python):
S = input()

ans = ""
for c in S:
    if c.islower():
        ans += c.upper()
    else:
        ans += c.lower()

print(ans)

Solution (Python):
s = input()

for i in range(len(s)):
    if (s[i].isupper()):
        print(s[i].lower(), end="")
    elif (s[i].islower()):
        print(s[i].upper(), end="")
    else:
        print(s[i], end="")
print()

Solution (Python):
s=list(input())

for c in map(ord,s):
	if ord('A') <= c and c <= ord('Z'):
		print(chr(c+(ord('a'))-ord('A')),end="")
	elif ord('a') <= c and c <= ord('z'):
		print(chr(c+(ord('A')-ord('a'))),end="")
	else:
		print(chr(c),end="")
print()

Solution (Python):
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
buf = str(input())
print(buf.swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
import sys
 
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
 
 
buf = str(input())
print(buf.swapcase())

Solution (Python):
n=input()
m=''
for i in range(len(n)):
    c=str(n[i])
    if(n[i].islower()):
        c=n[i].upper()
    elif(n[i].isupper()):
        c=n[i].lower()
    m+=c
print(m)

Solution (Python):
s = "abcdefghijklmnopqrstuvwxyz"
S = s.upper()
ans = ""
for i in input():
    if i in s:
        ans += i.upper()
    elif i in S:
        ans += i.lower()
    else:
        ans += i
print(ans)

Solution (Python):
import sys,os,re
from collections import Counter,deque
from operator import itemgetter
from itertools import accumulate,combinations
sys.setrecursionlimit(10**6)

s=list(input())
for i in range(len(s)):
    if s[i]==s[i].lower():
        s[i]=s[i].upper()
    else:
        s[i]=s[i].lower()
print("".join(s))

Solution (Python):
print(input().swapcase())

Solution (Python):
st=input()
b=st.swapcase()
print(b)

Solution (Python):
a = input()
print(a.swapcase())

Solution (Python):
s = str(input())
ans = ''
for i in range(len(s)):
    tmp = s[i]
    if 'A'<=s[i]<='Z':
        ans += tmp.lower()
    elif 'a'<=s[i]<='z':
        ans += tmp.upper()
    else:
        ans += tmp
print(ans)

Solution (Python):
print(str(input().swapcase()))

Solution (Python):
alphabet_lowercase = [chr(i) for i in range(97, 97 + 26)]
alphabet_uppercase = [chr(i) for i in range(65, 65 + 26)]

input_string = input()
output_string = ""
for s in input_string:
    if s in alphabet_lowercase:
        output_string += alphabet_uppercase[alphabet_lowercase.index(s)]
    elif s in alphabet_uppercase:
        output_string += alphabet_lowercase[alphabet_uppercase.index(s)]
    else:
        output_string += s

print(output_string)

Solution (Python):
a = input()
print(str.swapcase(a))

Solution (Python):
s=input()
for c in s:
	a=(ord(c))
	if a>=65 and a<=90:
		a+=32
		print(chr(a),end='')
	elif a>=97 and a<=97+25:
		a-=32
		print(chr(a),end='')
	else:
		print(c,end='')
print()

Solution (Python):
a = str(input())
print(a.swapcase())

Solution (Python):
string=input()
new_string=""
for s in string:
    if 'a'<=s<='z':
        new_string+=s.upper()
    elif 'A'<=s<='Z':
        new_string+=s.lower()
    else:
        new_string+=s
print(new_string)

Solution (Python):
import sys

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001


buf = str(input())
print(buf.swapcase())

Solution (Python):
text = input()
ans = ""
for w in text:
    if w.isupper() == True:
        ans += w.lower()
    elif w.islower() == True:
        ans += w.upper()
    else:
        ans += w

print(ans)

Solution (Python):
print(input().swapcase())

Solution (Python):
n=input()
m=''
for i in range(len(n)):
    c=str(n[i])
    if(n[i].islower()):
        c=n[i].upper()
    elif(n[i].isupper()):
        c=n[i].lower()
    m+=c
print(m)

Solution (Python):
	
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
line = input()

for ch in line:
    if ord('a') <= ord(ch) <= ord('z'):
        ch = chr(ord(ch)-32)
    elif ord('A') <= ord(ch) <= ord('Z'):
        ch = chr(ord(ch)+32)

    print(ch, end='')

print()

Solution (Python):
n=input()
m=''
for i in range(len(n)):
    c=str(n[i])
    if(n[i].islower()):
        c=n[i].upper()
    elif(n[i].isupper()):
        c=n[i].lower()
    m+=c
print(m)

Solution (Python):
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
s = input()
print(s.swapcase())

Solution (Python):
if __name__ == "__main__":
    input_str = input()
    print("".join([s.upper() if s.islower() else s.lower() for s in input_str]))

Solution (Python):
a = [s for s in input().split()]

b = []
for i in range(len(a)):
    b.append(list(a[i]))
    
for i in range(len(b)):
    for j in range(len(b[i])):
        if b[i][j].isupper() == True:
            b[i][j] = b[i][j].lower()
        elif b[i][j].islower() == True:
            b[i][j] = b[i][j].upper()
    b[i] = "".join(b[i])
b = " ".join(b)
print(b)

Solution (Python):
print(input().swapcase())

Solution (Python):
string = input()
print(string.swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
s = str(input())
print(s.swapcase())

Solution (Python):
s=input()
for c in s:
  if 'A' <= c and c <= 'Z':
    print(c.lower(),end='')
  elif 'a' <= c and c <= 'z':
    print(c.upper(),end='')
  else:
    print(c,end='')
print()

Solution (Python):
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):






import sys
import math
import array


class mymath:
    
    pi = 3.14159265358979323846264338

    
    def pnum_eratosthenes(self, n):
        ptable = [0 for i in range(n+1)]
        plist = []

        for i in range(2, n+1):
            if ptable[i]==0:
                plist.append(i)
                for j in range(i+i, n+1, i):
                    ptable[j] = 1
        return plist

    
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

    
    def lcm(self, a, b):
        return (a*b)//self.gcd(a,b)

    
    def mul(self, A, B):
        ans = []
        for a in A:
            c = 0
            for j, row in enumerate(a):
                c += row*B[j]
            ans.append(c)
        return ans

mymath = mymath()


class output:
    
    def list(self, l):
        l = list(l)
        
        for i, num in enumerate(l):
            print(num, end="")
            if i != len(l)-1:
                print(" ", end="")
        print()

output = output()



















def main():

    N = input()

    for i, row in enumerate(N):
        if row.isupper() == True:
            N = N[:i] + row.lower() + N[i+1:]
        elif row.islower() == True:
            N = N[:i] + row.upper() + N[i+1:]

    print(N)

if __name__ == '__main__':
    main()

Solution (Python):
string = input()
ans = ""
for s in string:
    if s.isupper():
        ans += s.lower()
    else:
        ans += s.upper()
print(ans)

Solution (Python):
string = input()

for c in string:
    if c.isupper():
        print(c.lower(), end='')
    elif c.islower():
        print(c.upper(), end='')
    else:
        print(c, end='')
print()

Solution (Python):
import sys
 
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
 
 
buf = str(input())
print(buf.swapcase())

Solution (Python):
a = str(input())

print(str.swapcase(a))

Solution (Python):
a = str(input())

print(str.swapcase(a))

Solution (Python):
s=input()
for i in s:
    if i==i.lower():
        print(i.upper(),end='')
    else:
        print(i.lower(),end='')
print()

Solution (Python):
str= input()
print(str.swapcase())

Solution (Python):
text = input()
print(text.swapcase())

Solution (Python):
for c in input():
    if c.isupper():
        print(c.lower(), end='')
    else:
        print(c.upper(), end='')
        
print()

Solution (Python):
s = input()
t = s.swapcase()
print(t)

Solution (Python):
print(input().swapcase())

Solution (Python):
s = input()
print(s.swapcase())

Solution (Python):
str = input()
list = list(str)

for i in range(len(list)):
    if list[i].isupper():
        list[i] = list[i].lower()
    else:
        list[i] = list[i].upper()

print("".join(list))

Solution (Python):

A=input()
print(A.swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
s=input()
s2=""
for i in s:
    if i.isupper():
        s2+=i.lower()
    elif i.islower():
        s2+=i.upper()
    else:
        s2+=i
print(s2)

Solution (Python):
s = input()

print(s.swapcase())

Solution (Python):
s = input()
 
print(s.swapcase())

Solution (Python):
s = input()
 
for c in s:
    if c.islower():
        print(c.upper(), end="")
    else:
        print(c.lower(), end="")
print()

Solution (Python):
target=input()
x=target.swapcase()
print(x)

Solution (Python):
str = input()
print(str.swapcase())

Solution (Python):
L=input()
M=L.swapcase()
print(M)

Solution (Python):
st = input()

print(str.swapcase(st))

Solution (Python):
print(input().swapcase())

Solution (Python):


from collections import* 
from fractions import gcd
from functools import* 
from itertools import* 
from operator import mul
from bisect import* 
from heapq import* 
from math import factorial,pi
from copy import deepcopy
import sys

sys.setrecursionlimit(10**6)


def main():
    print(input().swapcase())
if __name__ == '__main__':
    main()

Solution (Python):
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
moji = str(input())
print(moji.swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
a = input()
print(str.swapcase(a))

Solution (Python):
a = input()
print(str.swapcase(a))

Solution (Python):
import sys
 
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
 
 
buf = str(input())
print(buf.swapcase())

Solution (Python):
line = input()
print(line.swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
S = input()
print(S.swapcase())

Solution (Python):
def toggle_case(c):
    ascii_code = ord(c)
    if 65 <= ascii_code <= 90:
        return chr(ascii_code + 32)
    elif 97 <= ascii_code <= 122:
        return chr(ascii_code + -32)
    
    return c

res = list(input())
res = [toggle_case(c) for c in res]
print("".join(res))

Solution (Python):
s = input()
print(s.swapcase())

Solution (Python):
if __name__ == '__main__':
	s = input()
	print("%s" % (s.swapcase()))

Solution (Python):
str = input()
str = str.swapcase()
print(str)

Solution (Python):
x = input()
ans = ''
for v in x:
    if str.isupper(v):
        ans += str.lower(v)
    elif str.islower(v):
        ans += str.upper(v)
    else:
        ans += v
print(ans)

Solution (Python):
string = input()
print(str.swapcase(string))

Solution (Python):
print(''.join(c.upper() if c.islower() else c.lower() for c in input()))

Solution (Python):
x = input()
x = x.swapcase()

print(x)

Solution (Python):
moji = input()

print(moji.swapcase())

Solution (Python):

print(input().swapcase())

Solution (Python):
s1 = input()
s2 = ''
for c in s1:
    if ord('a') <= ord(c) <= ord('z'):
        c0 = chr(ord(c) - ord('a') + ord('A'))
    elif ord('A') <= ord(c) <= ord('Z'):
        c0 = chr(ord(c) - ord('A') + ord('a'))
    else:
        c0 = c
    s2 += c0
print(s2)

Solution (Python):
buf = str(input())
print(buf.swapcase())

Solution (Python):
text = input()
print(text.swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
Str = input().strip().split()
Str_len = len(Str)

for i in range(Str_len):
    Str[i] = Str[i].swapcase()

Str = ' '.join(Str)
print(Str)

Solution (Python):
str1 = input()
print(str1.swapcase())

Solution (Python):
a = str(input())
print(a.swapcase())

Solution (Python):
l = input()
s_l = l.swapcase()
print(s_l)

Solution (Python):
print(input().swapcase())

Solution (Python):
T = input()

print(T.swapcase())

Solution (Python):
inp = input()
print(inp.swapcase())

Solution (Python):
moji=str(input())
print(moji.swapcase())

Solution (Python):
str = input()
swap = ""
for ch in str:
    if ch.isupper():
        c = ch.lower()
    elif ch.islower():
        c = ch.upper()
    else:
        c = ch
    swap += c

print(swap)

Solution (Python):
str1 = input()
for i in str1:
    if i.isupper():
        print(i.lower(), end = "")
    elif i.islower():
        print(i.upper(), end = "")
    else:
        print(i, end = "")
print()

Solution (Python):
data = input()
output = []
for i in data:
  if i.islower():
    output.append(i.upper())
  else:
    output.append(i.lower())

for i in output:
  print(i, end="")

print()

Solution (Python):
s = input()
print(s.swapcase())

Solution (Python):
buf = str(input())

print(buf.swapcase())

Solution (Python):
iw = str(input())
ow=[]

s="abcdefghijklmnopqrstuvwxyz"
l="ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for i in iw:
    if i in s:
        ow1=l[s.index(i)]
    elif i in l:
        ow1=s[l.index(i)]
    else:
        ow1=i
    ow.append(ow1)

print("".join(ow))

Solution (Python):
c = input()
c = str.swapcase(c)
print(c)

Solution (Python):
A = input()
for i in A:
    if i.isalpha():
       print(i.swapcase(), end = '')
    else:
        print(i, end='')
print()

Solution (Python):
print (input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
strin =input()
print(strin.swapcase())

Solution (Python):
str = input()
print(str.swapcase())

Solution (Python):
s = input()
print (s.swapcase())

Solution (Python):
a= str(input())
a= str.swapcase(a)
print(a)

Solution (Python):
s=input()
s2=""
for i in s:
    if i.isupper():
        s2+=i.lower()
    elif i.islower():
        s2+=i.upper()
    else:
        s2+=i
print(s2)

Solution (Python):
print(input().swapcase())

Solution (Python):

line = input()
print(line.swapcase())

Solution (Python):
print(''.join(map(lambda x: [x.upper(), x.lower()][x.isupper()], input())))

Solution (Python):
s = input()
for i in s:
    if ord('A') <= ord(i) <= ord('Z'):
        print(chr(ord(i)+32) ,end = '')
    elif ord('a') <= ord(i) <= ord('z'):
        print(chr(ord(i)-32) ,end = '')
    else:
        print(i ,end = '')
print('')

Solution (Python):
print(input().swapcase())

Solution (Python):
strList = input()
print(strList.swapcase())

Solution (Python):
sent = input()
nsent = ""
for c in sent:
    if ord("a") <= ord(c) and ord(c) <= ord("z"):
        nsent += chr(ord(c) + ord("A") - ord("a"))
    elif ord("A") <= ord(c) and ord(c) <= ord("Z"):
        nsent += chr(ord(c) + ord("a") - ord("A"))
    else:
        nsent += c

print(nsent)

Solution (Python):
a=input()
print(a.swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
s = str(input())
print(s.swapcase())

Solution (Python):
str = input()
print(str.swapcase())

Solution (Python):
sentence = str(input())
print(sentence.swapcase())

Solution (Python):
str = input()
str2 = str.swapcase()
print(str2)

Solution (Python):
import sys

a = str(input())
print(a.swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
s = str(input())
print(s.swapcase())

Solution (Python):
S = input()

for i in range(len(S)):
    tmp = S[i]
    if tmp.islower():
        tmp = tmp.upper()
    else:
        tmp = tmp.lower()

    print(tmp, end="")

print()

Solution (Python):
print(input().swapcase())

Solution (Python):
a = input()
print(a.swapcase())

Solution (Python):
cap = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
lower = list("abcdefghijklmnopqrstuvwxyz")
dic = dict(zip(cap+lower, lower+cap))
tex = input()
out = [dic[i] if i in dic else i for i in tex]
print("".join(out))

Solution (Python):
inStr = input()
outStr = inStr.swapcase()
print(outStr)

Solution (Python):
print(input().swapcase())

Solution (Python):
import sys
import string

trans = str.maketrans(
    string.ascii_lowercase + string.ascii_uppercase,
    string.ascii_uppercase + string.ascii_lowercase
)

print(sys.stdin.read().translate(trans), end='')

Solution (Python):
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
string = input()
answer = ''
for ch in string:
    if ch.isupper():
        answer += ch.lower()
    elif ch.islower():
        answer += ch.upper()
    else:
        answer += ch
print(answer)

Solution (Python):
print(input().swapcase())

Solution (Python):
s = input()

for c in s:
    if c.islower():
        print(c.upper(), end="")
    else:
        print(c.lower(), end="")
print()

Solution (Python):
str=input()
print(str.swapcase())

Solution (Python):


letters = input()
print(letters.swapcase())

Solution (Python):
print (str(input()).swapcase())

Solution (Python):
s=input()
print(s.swapcase())

Solution (Python):
moji = input()
print(moji.swapcase())

Solution (Python):
s = input()

print(s.swapcase())

Solution (Python):
a = input()
print(a.swapcase())

Solution (Python):
inline = str(input())
print(inline.swapcase())

Solution (Python):
s = input()
print(s.swapcase())

Solution (Python):
A=input().split()
B=[A[i].swapcase() for i in range(0,len(A))]
print(" ".join(B))

Solution (Python):
s = input()
for c in s:
    if c.isupper():
        print(c.lower(), end="")
    elif not c.isalpha():
        print(c, end="")
    else:
        print(c.upper(), end="")
print()

Solution (Python):
a=input()
b=a.swapcase()
print(b)

Solution (Python):





N = input()
result = [string.swapcase() for string in N] 
print("".join(result))

Solution (Python):
for c in input():
    if 'a'<=c<='z':
        print(chr(ord(c)^0x20), end='')
    elif 'A'<=c<='Z':
        print(chr(ord(c)|0x20), end='')
    else:
        print(c, end='')
print()

Solution (Python):
str_in = input()
print(str_in.swapcase())

Solution (Python):
str_row = input()
print(str_row.swapcase())

Solution (Python):
str = input()

print(str.swapcase())

Solution (Python):
string=input()
print(string.swapcase())

Solution (Python):
str = input()
print(str.swapcase())

Solution (Python):
array = input().split(',')
ans = [ary.swapcase() for ary in array]
print(','.join(ans))

Solution (Python):
print(input().swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
import sys

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001


buf = str(input())
print(buf.swapcase())

Solution (Python):
a = input()

print(a.swapcase())

Solution (Python):
A = list(map(str,input().split(", ")))
for i in range(len(A)):
    A[i] = A[i].swapcase()

word = A[0]
for k in range(1,len(A)):
    if k < len(A):
        word = word +", "+str(A[k])
    else:
        word = word + str(A[k])
print(word)

Solution (Python):
print(input().swapcase())

Solution (Python):


if __name__ == '__main__':
    s = map(ord, list(raw_input()))
    for i in range(len(s)):
        if s[i] > 0x40 and (s[i]-0x41)%0x20 < 0x1a:
            s[i]^=0x20
    print ''.join(map(chr, s))

Solution (Python):
n = input().rstrip()
print(n.swapcase())

Solution (Python):
s = input()
print(s.swapcase())

Solution (Python):
print(input().swapcase())

Solution (Python):
letter = input()
print(letter.swapcase())