func_code_string: #include <bits/stdc++.h>   using namespace std;   const int mx = 100010;   int arr[mx];   int main() {     string x;     int n, c = -1, temp = 0;     queue<int> stek;     map<int, int> visit;     cin >> n >> x;     for (int i = 0; i < n - 1; i++) {       if ((x[i] ==  o  and x[i + 1] ==  g ) ||           (x[i] ==  g  and x[i + 1] ==  o )) {         temp++;         if (c == -1 and x[i] ==  g ) {           temp = 0;           continue;         }         if (c == -1) c = i;       } else if (c != -1) {         if (x[i] ==  g  and temp == 1) {           temp = 0;           c = -1;           continue;         } else if (x[i] ==  g  and temp > 1) {           temp--;         }         stek.push(c);         visit[c] = temp;         temp = 0;         c = -1;       }     }     if (c != -1) {       if (x[n - 1] ==  g  and temp == 1) {       } else {         if (x[n - 1] ==  g  and temp > 1) {           temp--;         }         stek.push(c);         visit[c] = temp;         temp = 0;         c = -1;       }     }     for (int i = 0; i < n; i++) {       if (stek.front() == i) {         printf( *** );         i += visit[stek.front()];         stek.pop();       } else {         printf( %c , x[i]);       }     }     printf(  n );   }   