Rebus

In the last English lesson, Petryk received a homework assignment involving rebuses. Each rebus consists of a sequence of pictures, where apostrophes can be placed on either side of each picture. Each picture represents a specific word. Suppose there are $i$ apostrophes before a picture and $j$ apostrophes after it. This means that $i$ letters should be removed from the beginning of the word associated with that picture, and $j$ letters from the end. The remaining part of the word should replace the picture and its apostrophes. This should be done for each picture and its surrounding apostrophes. After that, the resulting pieces should be "glued" together into one word, which will be the answer to the rebus.

Petryk has no trouble associating each picture with a word, but he finds it tedious to remove extra letters and glue the words together. Therefore, he has asked for your help. You are given a string consisting of lowercase Latin letters, apostrophes (character code $39$), and spaces that separate words. An apostrophe belongs to a word if there is no space between them. If an apostrophe is to the left of a word, one letter must be removed from the beginning; if to the right — from the end. Then all the resulting words should be concatenated into one.

For example, let the string be "team ' ' ' ' school ' ' olympiad' ' '". In the first word, nothing needs to be changed, since no apostrophes are associated with it. In the second, you need to remove the first four letters, obtaining "ol"; from the third, "ymp" is obtained. After gluing the three pieces together, we get the string "teamolymp".

Note

For clarity, the test example is also shown in the image, which is closer to reality.