Company: exxonmobil_5sep
Difficulty: medium
Case Conversion Problem Problem Description John wrote a sequence of words in CamelCase as a string of letters s , having the following properties: The string s is a concatenation of one or more words consisting of English letters. All the letters of the first word are in lowercase. For each of the subsequent words, the first letter is in uppercase, and the rest of the letters are in lowercase. Given s , print each word in s in a new line after converting all the uppercase characters into lowercase and all the lowercase characters into uppercase. For example, s = oneTwoThree . Print each word i.e., ONE, TWO, THREE on a new line. Input Format The input consists of a single line: The line contains a string s . The input will be read from the STDIN by the candidate. Output Format Print each word in s separated by a line after converting the case of the letters. The output will be matched to the candidate's output printed on the STDOUT. Constraints 1 5 Examples Example 1: Input: saveChange