AT_abc416_b [ABC416B] 1D Akari

You are given a string $ S $ consisting of `.` and `#`. Among all strings $ T $ that satisfy all of the following conditions, find one with the maximum number of `o`s. - The length of $ T $ is equal to the length of $ S $ . - $ T $ consists of `.`, `#`, or `o`. - $ T_i= $ `#` if and only if $ S_i= $ `#`. - If $ T_i=T_j= $ `o` $ (i < j) $ , then there exists at least one `#` among $ T_{i+1},\ldots,T_{j-1} $ .

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

Output one string with the maximum number of `o`s among all strings $ T $ that satisfy all conditions. If there are multiple such strings, printing any of them will be considered correct.

### Sample Explanation 1 Setting $ T= $ `#o.#o` satisfies all conditions. There is no string $ T $ that satisfies all conditions and has more than two `o`s, so outputting `#o.#o` is correct. Outputting `#.o#o` is also correct. ### Sample Explanation 3 Outputting `o....`, `.o...`, `...o.`, or `....o` is also correct. ### Constraints - $ S $ is a string consisting of `.` and `#` with length between $ 1 $ and $ 100 $ , inclusive.