PROGRAMMING:Decipher English Tibetan Poems
This topic requests to write a program to decrypt English Tibetan poems. It is recommended to use the dynamic memory allocation method to process the input of strings.
###Input format:
The input is an English Tibetan poem, one line for each sentence, less than 20 lines, and no more than 80 characters for each line. The # is used as the end mark of Tibetan poem input.
###Output format:
Take out the first character of each sentence, join together to form a string and output.
###Input example:
```in
I come into a dream
Leaves fall down but spring
over a lake birds flying
village have its nice morning
everywhere can feel happiness
Years have never been
owners don't need anything
until the sun bring another wind
#
```
###Output example:
```out
ILoveYou
```
answer：If there is no answer, please comment
###Input format:
The input is an English Tibetan poem, one line for each sentence, less than 20 lines, and no more than 80 characters for each line. The # is used as the end mark of Tibetan poem input.
###Output format:
Take out the first character of each sentence, join together to form a string and output.
###Input example:
```in
I come into a dream
Leaves fall down but spring
over a lake birds flying
village have its nice morning
everywhere can feel happiness
Years have never been
owners don't need anything
until the sun bring another wind
#
```
###Output example:
```out
ILoveYou
```
answer：If there is no answer, please comment