AT_past20_c XX反転

You are given a string $ S $ consisting of lowercase English letters and exactly two `X`'s. Apply the following operation and print the resulting string. > Reverse the part between the two `X`'s in $ S $ , namely the part starting from the character right after the first `X` through the character right before the second `X`, which may be empty. Then, remove the two `X`'s and concatenate the remaining strings without changing their order to form a single string. The string $ T' $ obtained by reversing a string $ T $ is defined as the string whose length equals that of $ T $ , where the $ i $ -th $ (1\leq i\leq \lvert T\rvert) $ character of $ T' $ equals the $ (\lvert T\rvert+1-i) $ -th character of $ T $ . Here, $ \lvert T\rvert $ denotes the length of the string $ T $ .

The input is given from Standard Input in the following format: > $ S $

Print the resulting string after applying the operation against $ S $ .

### Sample Explanation 1 The substring between the two `X`'s is `nir`; reversing this part makes it `stXrinXg`. After removing the two `X`'s and concatenating the remaining strings preserving the order, it results in `string`. ### Sample Explanation 2 Note that reversing an empty string makes it an empty string. ### Constraints - $ S $ is a string of length between $ 3 $ and $ 100 $ , inclusive, consisting of lowercase English letters and `X`. - `X` occurs exactly twice in $ S $ .