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 JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Main2 {

    static String file = "game";
    static ArrayList<Integer>[] a;
    static byte[] dist, DIST;
    static boolean[] visited, VISITED;
    static boolean vrunishki;

    static void code() {
        sc.nextLine();
        char[] a = sc.nextLine().toCharArray();
        String s = new String();
        int i = 0;
        byte sost = 0;
        while (i < a.length) {
            switch (sost) {
                case 1:
                    if (a[i] == 'g') {
                        sost++;
                    } else {
                        s += 'o';
                        sost = 0;
                        if (a[i] == 'o') {
                            sost++;
                        } else {
                            s += a[i];
                        }
                    }
                    break;
                case 2:
                    if (a[i] == 'o') {
                        sost++;
                    } else {
                        s += "og" + a[i];
                        sost = 0;
                    }
                    break;
                case 0:
                    if (a[i] == 'o') {
                        sost++;
                    } else {
                        s += a[i];
                    }
                    break;
                default:
                    if (sost % 2 == 0) {
                        if (a[i] == 'o') {
                            sost++;
                        } else {
                            sost = 0;
                            s += "***g" + a[i];
                        }
                    } else {
                        if (a[i] == 'g') {
                            sost++;
                        } else {
                            sost = 0;
                            s += "***";
                            if (a[i] == 'o') {
                                sost++;
                            } else {
                                s += a[i];
                            }
                        }
                    }
                    break;
            }
            i++;
        }
        switch (sost) {
            case 0:
                break;
            case 1:
                s += 'o';
                break;
            case 2:
                s += "og";
                break;
            default:
                if (sost % 2 == 0) {
                    s += "***g";
                } else {
                    s += "***";
                }
        }
        pw.print(s);
    }

    static void DFS(int v) {
        visited[v] = true;
        int size = a[v].size();
        for (int i = 0; i < size; i++) {
            if (!visited[a[v].get(i)]) {
                if (VISITED[a[v].get(i)]) {
                    if (!VISITED[v]) {
                        VISITED[v] = true;
                        dist[v] = (byte) ((dist[a[v].get(i)] + 2) / 3);
                    } else {
                        if ((dist[v] + 1) % 3 != dist[a[v].get(i)]) {
                            vrunishki = true;
                            return;
                        }
                    }
                } else {
                    if (!VISITED[v]) {
                        DIST[a[v].get(i)] = (byte) ((DIST[v] + 1) % 3);
                        DFS(a[v].get(i));
                        if (vrunishki) {
                            return;
                        }
                        if (VISITED[a[v].get(i)]) {
                            i = -1;
                        }
                    } else {
                        DIST[a[v].get(i)] = (byte) ((DIST[v] + 1) % 3);
                        dist[a[v].get(i)] = (byte) ((dist[v] + 1) % 3);
                        DFS(a[v].get(i));
                        if (vrunishki) {
                            return;
                        }
                        if (VISITED[a[v].get(i)]) {
                            i = -1;
                        }
                    }
                }
            } else {
                if ((DIST[v] + 1) % 3 != DIST[a[v].get(i)]) {
                    vrunishki = true;
                    return;
                }
            }
        }
    }

    //static int R;

    public static void main(String[] args) throws IOException {

        sc = new FScanner(/*new FileInputStream(new File(file + ".in"))*/ System.in);
        pw = new PrintWriter(new BufferedOutputStream(/*new FileOutputStream(file + ".out")*/ System.out) /*FileWriter(new File(file + ".out"))*/);
        code();
        pw.close();
    }

    static PrintWriter pw;
    static FScanner sc;

    static class Matrica {
        int a, b, c, d;
    }

    static class NodeOtreskov {
        Matrica[] a;
        int size;
        long l, r;
        Matrica neytral;

        NodeOtreskov(int n) {
            size = 1;
            while (size < n) {
                size *= 2;
            }
            a = new Matrica[2 * size - 1];
            neytral = new Matrica();
            neytral.a = 1;
            neytral.d = 1;
            for (int i = 0; i < a.length; i++) {
                a[i] = neytral;
            }
        }


    }

    static class FScanner {
        private BufferedReader br;
        private StringTokenizer tokenizer;

        public FScanner(InputStream stream) throws FileNotFoundException {
            br = new BufferedReader(new InputStreamReader(stream));
        }

        public boolean hasNext() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    String s = br.readLine();
                    if (s == null) {
                        return false;
                    }
                    tokenizer = new StringTokenizer(s);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.hasMoreTokens();
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public String nextLine() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    return br.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken("\n");
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
}