#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
char str_init[maxn], str_dest[maxn];
int N;
bool is_st[maxn];
bool isOK(char* s, int i, int j) {
  if ((j - i) % 2) return false;
  if (s[i] != 'o') return false;
  for (int k = i + 1; k <= j; k++) {
    if (s[k - 1] == 'o' && s[k] != 'g') return false;
    if (s[k - 1] == 'g' && s[k] != 'o') return false;
  }
  return true;
}
void TianXie(char* s, int i, int j) {
  for (int k = i; k < j + 1; k++) str_dest[k] = '*';
}
int main(int argc, char** argv) {
  scanf("%d", &N);
  scanf("%s", str_init);
  strncpy(str_dest, str_init, N);
  for (int i = 0; i < N; i++)
    for (int j = N - 1; j > i; j--) {
      if (isOK(str_init, i, j)) {
        TianXie(str_dest, i, j);
        is_st[i] = true;
        i = j;
        break;
      }
    }
  for (int i = 0; i < N; i++) {
    if (str_dest[i] == '*' && is_st[i]) {
      printf("***");
      while (str_dest[i + 1] == '*' && !is_st[i + 1]) i++;
    } else {
      printf("%c", str_dest[i]);
    }
  }
  return 0;
}
