Problems
Youngseok, who cannot read yet, is playing with a toy that lets him stick magnetic letters on a blackboard.
The letters on the toy include uppercase English letters A–Z, lowercase English letters a–z, and digits 0–9.
Youngseok arranges the letters horizontally on the blackboard to make a word. Then he makes another word below it, and so on, creating a total of five words.
Each word consists of consecutive letters without spaces, with a maximum length of 15 characters.
The lengths of the five words may differ.
Youngseok wants to read the words vertically.
When reading vertically, he reads the first letter of each word from top to bottom, then the second letter of each word, and so on, moving left to right.
If a word does not have a letter in that position, it is skipped.
For example, in the fifth column of the words, if the second word has no fifth letter, it is skipped.
Given the five words on the blackboard, print the letters in the order Youngseok reads them vertically, concatenated without spaces.
Input
Five lines, each containing 1 to 15 consecutive characters without spaces.
Each character is either an uppercase letter A–Z, a lowercase letter a–z, or a digit 0–9.
There are no leading or trailing spaces.
Output
A single line containing all the letters read vertically, concatenated without spaces
Example #1
ABCDE
abcde
01234
FGHIJ
fghij
Aa0FfBb1GgCc2HhDd3IiEe4Jj
Example #2
AABCDD
afzz
09121
a8EWg6
P5h3kx
Aa0aPAf985Bz1EhCz2W3D1gkD6x
You must sign in to write code.