Problem: Polycarp has interviewed Oleg and has written the interview down without punctuation marks and spaces to save time. Thus, the interview is now a string s consisting of n lowercase English letters.

There is a filler word ogo in Oleg's speech. All words that can be obtained from ogo by adding go several times to the end of it are also considered to be fillers. For example, the words ogo, ogogo, ogogogo are fillers, but the words go, og, ogog, ogogog and oggo are not fillers.

The fillers have maximal size, for example, for ogogoo speech we can't consider ogo a filler and goo as a normal phrase. We should consider ogogo as a filler here.

To print the interview, Polycarp has to replace each of the fillers with three asterisks. Note that a filler word is replaced with exactly three asterisks regardless of its length.

Polycarp has dealt with this problem in no time. Can you do the same? The clock is ticking!

Input

The first line contains a positive integer n (1 ≤ n ≤ 100) — the length of the interview.

The second line contains the string s of length n, consisting of lowercase English letters.

Output

Print the interview text after the replacement of each of the fillers with "***". It is allowed for the substring "***" to have several consecutive occurences.

Examples

Input

7
aogogob


Output

a***b


Input

13
ogogmgogogogo


Output

***gmg***


Input

9
ogoogoogo


Output

*********

Note

The first sample contains one filler word ogogo, so the interview for printing is "a***b".

The second sample contains two fillers ogo and ogogogo. Thus, the interview is transformed to "***gmg***".

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const double eps = 1e-16;
char s[MAXN], ans[MAXN];
void solve() {
  int n;
  while (cin >> n) {
    int len = 0;
    scanf("%s", s);
    for (int i = 0; i < n; ++i) {
      if (s[i] == 'o' && s[i + 1] == 'g' && s[i + 2] == 'o') {
        ans[len++] = '*';
        ans[len++] = '*';
        ans[len++] = '*';
        i += 3;
        for (; i < n; i += 2) {
          if (s[i] == 'g' && s[i + 1] == 'o')
            ;
          else {
            i -= 1;
            break;
          }
        }
      } else
        ans[len++] = s[i];
    }
    ans[len] = 0;
    puts(ans);
  }
}
int main() {
  solve();
  return 0;
}