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.List;
import java.util.Scanner;
import java.util.function.Function;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

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

        final List<Integer> list = IntStream.range(0, n)
                .mapToObj(i -> s.charAt(i) == 'o' ? 1 : -1)
                .collect(Collectors.toList());

        System.out.println(answer(list));
    }

    private static String answer(final List<Integer> list) {
        final int[] a1 = {1, -1};
        final int[] a2 = {1, -1};
        final Function<int[], String> answerGenerator = array -> IntStream.range(0, list.size())
                .mapToObj(i -> new StringBuilder(array[i] == 1 ? "S" : "W"))
                .collect(Collectors.joining());

        final int[] array = new int[list.size()];
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < 2; j++) {
                array[0] = a1[i];
                array[1] = a2[j];
                if (simulate(array, list)) {
                    return answerGenerator.apply(array);
                }
            }
        }
        return "-1";
    }

    private static boolean simulate(final int[] array, final List<Integer> list) {
        for (int i = 1; i < array.length - 1; i++) {
            array[i + 1] = array[i] * list.get(i) * array[i - 1];
        }
        return isCorrect(array, list, array.length - 1) && isCorrect(array, list, 0);
    }

    private static boolean isCorrect(final int[] array, final List<Integer> list, final int index) {
        final int former = (array.length + index - 1) % array.length;
        final int latter = (index + 1) % array.length;
        return array[index] * list.get(index) * array[former] * array[latter] == 1;
    }
}
