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.util.Scanner;

public class Main
{
    private static boolean solve(String s, Boolean[] xs)
    {
        char[] report = s.toCharArray();
        for (int i = 0; i < report.length; i++) {
            int src;
            int dst;
            if (i == 0) {
                src = 1;
                dst = report.length - 1;
            }
            else {
                src = i - 1;
                dst = i + 1;
            }

            boolean type = xs[i];
            if (type) {
                // Sheep
                if (report[i] == 'o') {
                    if (i == report.length - 2) {
                        if (xs[dst] != xs[src]) {
                            return false;
                        }
                    }
                    else if (i == report.length - 1) {
                        return xs[src] == xs[0];
                    }
                    else {
                        xs[dst] = xs[src];
                    }
                }
                else {
                    if (i == report.length - 2) {
                        if (xs[dst] == xs[src]) {
                            return false;
                        }
                    }
                    else if (i == report.length - 1) {
                        return xs[src] != xs[0];
                    }
                    else {
                        xs[dst] = !xs[src];
                    }
                }
            }
            else {
                // Wolf
                if (report[i] == 'o') {
                    if (i == report.length - 2) {
                        if (xs[dst] == xs[src]) {
                            return false;
                        }
                    }
                    else if (i == report.length - 1) {
                        return xs[src] != xs[0];
                    }
                    else {
                        xs[dst] = !xs[src];
                    }
                }
                else {
                    if (i == report.length - 2) {
                        if (xs[dst] != xs[src]) {
                            return false;
                        }
                    }
                    else if (i == report.length - 1) {
                        return xs[src] == xs[0];
                    }
                    else {
                        xs[dst] = xs[src];
                    }
                }
            }
        }

        throw new IllegalStateException("Shouldn't reach here");
    }

    private static String convResult(Boolean[] xs)
    {
        StringBuilder sb = new StringBuilder(xs.length);
        for (boolean b : xs) {
            if (b) {
                sb.append('S');
            }
            else {
                sb.append('W');
            }
        }
        return sb.toString();
    }

    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        String s = scanner.next();

        {
            Boolean[] xs = new Boolean[n];
            xs[0] = true;
            xs[1] = true;
            if (solve(s, xs)) {
                System.out.println(convResult(xs));
                return;
            }
        }

        {
            Boolean[] xs = new Boolean[n];
            xs[0] = true;
            xs[1] = false;
            if (solve(s, xs)) {
                System.out.println(convResult(xs));
                return;
            }
        }

        {
            Boolean[] xs = new Boolean[n];
            xs[0] = false;
            xs[1] = true;
            if (solve(s, xs)) {
                System.out.println(convResult(xs));
                return;
            }
        }

        {
            Boolean[] xs = new Boolean[n];
            xs[0] = false;
            xs[1] = false;
            if (solve(s, xs)) {
                System.out.println(convResult(xs));
                return;
            }
        }

        System.out.println("-1");
    }
}

