{"raw_statement":[{"iden":"statement","content":"Take a single string S as input, then make all capital characters lowercase and all lowercase characters capital.\n\nA single string S containing the string to switch.\n\nThe string S after being switched.\n\nThe string will not contain spaces or non-alphabetic characters.\n\n"},{"iden":"input","content":"A single string S containing the string to switch."},{"iden":"output","content":"The string S after being switched."},{"iden":"note","content":"The string will not contain spaces or non-alphabetic characters."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ S \\in \\Sigma^* $ be the input string, where $ \\Sigma = \\{a, b, \\dots, z, A, B, \\dots, Z\\} $.\n\n**Objective**  \nCompute the string $ S' $ such that for each character $ c \\in S $:  \n$$\nc' =\n\\begin{cases}\n\\text{lowercase}(c) & \\text{if } c \\text{ is uppercase}, \\\\\n\\text{uppercase}(c) & \\text{if } c \\text{ is lowercase}.\n\\end{cases}\n$$  \nOutput $ S' $.","simple_statement":"Switch the case of each letter in the string: uppercase becomes lowercase, lowercase becomes uppercase.","has_page_source":false}