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 java.io.*;
import java.math.*;
import java.util.*;
 
public class Main {
    private static boolean debug = false;
    private static boolean elapsed = false;
 
    private static PrintWriter _out = new PrintWriter(System.out);
    private static PrintWriter _err = new PrintWriter(System.err);
 
    private static class A {
        boolean left;
        char ch;
        boolean same;
        boolean sheep;
        boolean right;
        public A(boolean sheep, char ch) {
            this.sheep = sheep;
            this.ch = ch;
            if (sheep) {
                same = (ch == 'o');
            } else {
                same = (ch != 'o');
            }
            if (!same) {
                right = true;
            }
        }
    }
    private void solve(Scanner sc) {
        int N = sc.nextInt();
        sc.nextLine();
        String s = sc.nextLine();
 
        String[] pat = { "SS", "SW", "WS", "WW", };
        for (int i = 0; i < pat.length; ++i) {
            StringBuilder sb = new StringBuilder();
            sb.append(pat[i]);
            for (int j = 1; j < N - 1; ++j) {
                char ch = s.charAt(j);
                char ch2 = sb.charAt(j);
                char ch3 = sb.charAt(j - 1);
                if (ch == 'o') {
                    if (ch2 == 'S') {
                        sb.append(ch3);
                    } else {
                        if (ch3 == 'S') {
                            sb.append('W');
                        } else {
                            sb.append('S');
                        }
                    }
                } else {
                    if (ch2 == 'W') {
                        sb.append(ch3);
                    } else {
                        if (ch3 == 'S') {
                            sb.append('W');
                        } else {
                            sb.append('S');
                        }
                    }
                }
            }
            if (s.charAt(0) == 'o') {
                if (sb.charAt(0) == 'S') {
                    if (sb.charAt(1) != sb.charAt(N - 1)) {
                        continue;
                    }
                } else {
                    if (sb.charAt(1) == sb.charAt(N - 1)) {
                        continue;
                    }
                }
            } else {
                if (sb.charAt(0) == 'W') {
                    if (sb.charAt(1) != sb.charAt(N - 1)) {
                        continue;
                    }
                } else {
                    if (sb.charAt(1) == sb.charAt(N - 1)) {
                        continue;
                    }
                }
            }
            if (s.charAt(N - 1) == 'o') {
                if (sb.charAt(N - 1) == 'S') {
                    if (sb.charAt(0) == sb.charAt(N - 2)) {
                        _out.println(sb);
                        return;
                    }
                } else {
                    if (sb.charAt(0) != sb.charAt(N - 2)) {
                        _out.println(sb);
                        return;
                    }
                }
            } else {
                if (sb.charAt(N - 1) == 'W') {
                    if (sb.charAt(0) == sb.charAt(N - 2)) {
                        _out.println(sb);
                        return;
                    }
                } else {
                    if (sb.charAt(0) != sb.charAt(N - 2)) {
                        _out.println(sb);
                        return;
                    }
                }
            }
        }
 
        _out.println(-1);
    }
    private static BigInteger C(long n, long r) {
        BigInteger res = BigInteger.ONE;
        for (long i = n; i > n - r; --i) {
            res = res.multiply(BigInteger.valueOf(i));
        }
        for (long i = r; i > 1; --i) {
            res = res.divide(BigInteger.valueOf(i));
        }
        return res;
    }
    private static BigInteger P(long n, long r) {
        BigInteger res = BigInteger.ONE;
        for (long i = n; i > n - r; --i) {
            res = res.multiply(BigInteger.valueOf(i));
        }
        return res;
    }
    /*
     * 10^10 > Integer.MAX_VALUE = 2147483647 > 10^9
     * 10^19 > Long.MAX_VALUE = 9223372036854775807L > 10^18
     */
    public static void main(String[] args) {
        long S = System.currentTimeMillis();
 
        Scanner sc = new Scanner(System.in);
        new Main().solve(sc);
        _out.flush();
 
        long G = System.currentTimeMillis();
        if (elapsed) {
            _err.println((G - S) + "ms");
        }
        _err.flush();
    }
}