Snuke, who loves animals, built a zoo.

There are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle. The animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.

There are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.

Snuke cannot tell the difference between these two species, and asked each animal the following question: "Are your neighbors of the same species?" The animal numbered i answered s_i. Here, if s_i is `o`, the animal said that the two neighboring animals are of the same species, and if s_i is `x`, the animal said that the two neighboring animals are of different species.

More formally, a sheep answered `o` if the two neighboring animals are both sheep or both wolves, and answered `x` otherwise. Similarly, a wolf answered `x` if the two neighboring animals are both sheep or both wolves, and answered `o` otherwise.

Snuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print `-1`.

Constraints

* 3 ≤ N ≤ 10^{5}
* s is a string of length N consisting of `o` and `x`.

Input

The input is given from Standard Input in the following format:


N
s


Output

If there does not exist an valid assignment that is consistent with s, print `-1`. Otherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.

* t is a string of length N consisting of `S` and `W`.
* If t_i is `S`, it indicates that the animal numbered i is a sheep. If t_i is `W`, it indicates that the animal numbered i is a wolf.

Examples

Input

6
ooxoox


Output

SSSWWS


Input

3
oox


Output

-1


Input

10
oxooxoxoox


Output

SSWWSSSWWS
import sun.security.acl.WorldGroupImpl;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.*;

public class Main {

    static int N;
    static String S;
    final static char o = 'o';
    final static char x = 'x';
    final static char SHEEP = 'S';
    final static char WOLF = 'W';

    public static void main(String[] args) {
        FastScanner sc = new FastScanner(System.in);
        N = sc.nextInt();
        S = sc.next();
        System.out.println( solve() );
    }

    private static String solve() {

        String ans = isOk(SHEEP, SHEEP);
        if( ans != null ) return ans;
        ans = isOk(SHEEP, WOLF);
        if( ans != null ) return ans;
        ans = isOk(WOLF, SHEEP);
        if( ans != null ) return ans;
        ans = isOk(WOLF, WOLF);
        if( ans != null ) return ans;
        return "-1";

    }

    private static String isOk(char first, char second) {
        char c0 = S.charAt(0);
        char last;
        if( first == SHEEP ) {
            if( c0 == o ) {
                last = second;

            } else {
                last = flip(second);
            }
        } else {
            if( c0 == o ) {
                last = flip(second);

            } else {
                last = second;
            }
        }

        StringBuilder b = new StringBuilder();
        b.append(first);
        char prev = first;
        char curr = second;
        for (int i = 1; i < N; i++) {
            b.append(curr);

            char c = S.charAt(i);

            char next;
            if( curr == SHEEP ) {
                if( c == o ) {
                    next = prev;

                } else {
                    next = flip(prev);
                }
            } else {
                if( c == o ) {
                    next = flip(prev);

                } else {
                    next = prev;
                }
            }

            prev = curr;
            curr = next;
        }

        if( b.charAt(0) == curr && last == b.charAt(N-1) ) {
            return b.toString();
        } else {
            return null;
        }
    }

    static char flip(char animal) {
        return animal == SHEEP ? WOLF : SHEEP;
    }

    static class FastScanner {

        private BufferedReader reader;
        private StringTokenizer tokenizer;

        FastScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
            tokenizer = null;
        }

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

        String nextLine() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    return reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }

            return tokenizer.nextToken("\n");
        }

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

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

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

        int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

        long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = nextLong();
            return a;
        }
    }
}

