#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pci = pair<char, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
const ll infll = 1e18 + 3;
const int maxn = 1e6 + 77;
const int nmax = 1e6 + 77;
const ll basell = 1e18 + 3;
const int mod = 1e9 + 7;
const ld eps = 1e-7;
const int inf = 1009000999;
const int nv = 100100;
const int baseint = 1000200013;
const ld PI = acos(-1.0);
inline bool EQ(ld a, ld b) { return fabs(a - b) < 1e-9; }
int inline solve() {
  ios::sync_with_stdio(NULL), cin.tie(NULL), cout.tie(NULL);
  ;
  int n;
  cin >> n;
  string s, str;
  cin >> s;
  if (n < 3) return cout << s, 0;
  int h = 0;
  s += 'X';
  s += 'X';
  for (int i = 2; i < n; ++i) {
    if (s[i - 2] == 'o' && s[i - 1] == 'g' && s[i] == 'o') {
      h = i;
      i++;
    } else {
      if (h > 0) {
        h = 0;
        str += "***";
      } else {
        str += s[i - 2];
      }
    }
  }
  if (h > 0) {
    str += "***";
    if (h != n - 1) str += s[n - 1];
  } else {
    str += s[n - 2];
    str += s[n - 1];
  }
  cout << str;
}
int32_t main() {
  solve();
  return 0;
}
