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 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        char[] s = sc.next().toCharArray();
        char[] ans = new char[n];
        if (isCorrect('S', 'S', ans, s)) {
            System.out.println(String.valueOf(ans));
            return;
        }
        if (isCorrect('S', 'W', ans, s)) {
            System.out.println(String.valueOf(ans));
            return;
        }
        if (isCorrect('W', 'S', ans, s)) {
            System.out.println(String.valueOf(ans));
            return;
        }
        if (isCorrect('W', 'W', ans, s)) {
            System.out.println(String.valueOf(ans));
            return;
        }
        System.out.println(-1);
    }

    private static boolean isCorrect(char c1, char c2, char[] ans, char[] s) {
        ans[0] = c1;
        ans[1] = c2;
        boolean isOK = false;
        for (int i = 1; i < s.length; i++) {
            int idx = i + 1;
            if (i == s.length - 1) {
                idx = 0;
            }
            if (ans[i] == 'S') {
                if (s[i] == 'o') {
                    ans[idx] = ans[i - 1];
                } else if (s[i] == 'x' && ans[i - 1] == 'S') {
                    ans[idx] = 'W';
                } else if (s[i] == 'x' && ans[i - 1] == 'W') {
                    ans[idx] = 'S';
                }
            } else if (ans[i] == 'W') {
                if (s[i] == 'o' && ans[i - 1] == 'S') {
                    ans[idx] = 'W';
                } else if (s[i] == 'o' && ans[i - 1] == 'W') {
                    ans[idx] = 'S';
                } else if (s[i] == 'x') {
                    ans[idx] = ans[i - 1];
                }
            }
            if (i == s.length - 1) {
                if (ans[0] == 'S') {
                    if (s[0] == 'o' && ans[i] == ans[1] && ans[0] == c1) {
                        isOK = true;
                    } else {
                        isOK = (s[0] == 'x' && ans[i] != ans[1] && ans[0] == c1);
                    }
                } else if (ans[0] == 'W') {
                    if (s[0] == 'o' && ans[i] != ans[1] && ans[0] == c1) {
                        isOK = true;
                    } else {
                        isOK = (s[0] == 'x' && ans[i] == ans[1] && ans[0] == c1);
                    }
                }
            }
        }
        return isOK;
    }
}