AT_past19_e コメントの除去

> You want to implement a C-like comment-out system. You are given a length- $ N $ string $ S $ consisting of `/`, `*`, and lowercase English letters. You are asked to perform the following procedure against $ S $ . 1. Prepare a variable $ x $ that takes on an integer value. $ x $ is initialized with $ 1 $ . 2. Seek for an $ n $ such that: - $ x \leq n \leq |S| - 1 $ ; and - the $ n $ -th character of $ S $ is `/` and the $ (n + 1) $ -th character of $ S $ is `*`. 3. If no $ n $ satisfies the conditions in step 2, terminate the procedure. Otherwise, let $ i $ be the smallest such $ n $ . 4. Seek for an $ n $ such that: - $ i + 2 \leq n \leq |S| - 1 $ ; and - the $ n $ -th character of $ S $ is `*` and the $ (n + 1) $ -th character of $ S $ is `/`. 5. If no $ n $ satisfies the conditions in step 4, terminate the procedure. Otherwise, let $ j $ be the smallest such $ n $ . 6. Remove the $ i $ -th through $ (j + 1) $ -th characters of $ S $ , concatenate the remaining strings without changing the order, and set $ S $ to the resulting string. Set $ x $ to $ i $ , and go back to step 2. Print $ S $ resulting from the procedure.

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

Print the $ S $ resulting from the procedure.

### Sample Explanation 1 In this description, we denote the $ n $ -th character of $ S $ by $ S_n $ . The procedure proceeds as follows. - Initially, $ S = $ `a/*b*/c` and $ x = 1 $ . - Seek for an $ n $ satisfying the conditions in step 2. $ n = 2 $ satisfies $ x \leq n \leq |S|-1 $ , $ S_{n} $ = `/`, and $ S_{n+1} $ = `*`, and is the minimum $ n $ that satisfies these conditions. Thus, let $ i = 2 $ . - Seek for an $ n $ satisfying the conditions in step 4. $ n = 5 $ satisfies $ i + 2 \leq n \leq |S| - 1 $ , $ S_{n} = $ `*`, and $ S_{n+1} $ = `/`, and is the minimum $ n $ that satisfies these conditions. Thus, let $ j = 5 $ . - Remove the $ i = 2 $ -nd through $ j + 1 = 6 $ -th characters of $ S $ , concatenate the remaining strings without changing the order, and set $ S $ to the resulting string. Now $ S $ is `ac`. Set $ x $ to $ 2 $ , and go back to step 2. - Seeking for an $ n $ satisfying the conditions in step 2, one finds that there is no such $ n $ . Thus, the procedure terminates here. At the end of the procedure, $ S $ results in `ac`, which should be printed. ### Sample Explanation 2 At the end of the procedure, $ S $ may result in an empty string. ### Constraints - $ 1 \leq N \leq 10^6 $ - $ S $ is a length- $ N $ string consisting of `/`, `*`, and lowercase English letters. - $ N $ is an integer.