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.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.*;
public class Main {
    static int n;
    static String s ;
    static char []r1 ;
    static char []r2 ;
    static char []r3 ;
    static char []r4 ;
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        n = in.nextInt();
        s = in.next();
        r1 = new char[n];
        r2 = new char[n];
        r3 = new char[n];
        r4 = new char[n];
        r1[0] = 'S';
        r2[0] = 'S';
        r3[0] = 'W';
        r4[0] = 'W';
        if(s.charAt(0)=='o'){
            r1[1]='S';r1[n-1]='S';
            r2[1]='W';r2[n-1]='W';
            r3[1]='W';r3[n-1]='S';
            r4[1]='S';r4[n-1]='W';
        }
        else {
            r1[1]='W';r1[n-1]='S';
            r2[1]='S';r2[n-1]='W';
            r3[1]='S';r3[n-1]='S';
            r4[1]='W';r4[n-1]='W';

        }
        factory(r1);
//        for(int i=0;i<n;i++){
//            System.out.print(r1[i]);
//        }
//        System.out.println();
        if(printOut(r1)){
            return;
        }
        factory(r2);
//        for(int i=0;i<n;i++){
//            System.out.print(r2[i]);
//        }
//        System.out.println();
        if(printOut(r2)){
            return;
        }
        factory(r3);
//        for(int i=0;i<n;i++){
//            System.out.print(r3[i]);
//        }
//        System.out.println();
        if(printOut(r3)){
            return;
        }
        factory(r4);
//        for(int i=0;i<n;i++){
//            System.out.print(r4[i]);
//        }
//        System.out.println();
        if(printOut(r4)){
            return;
        }
        System.out.println(-1);

    }
    static void factory(char[] arr){
        for(int i =1;i<=n-3;i++){
            if(s.charAt(i)=='o'){
                if(arr[i]=='S'){
                    if(arr[i-1]=='S'){
                        arr[i+1]='S';
                    }
                    else {
                        arr[i+1]='W';
                    }
                }
                else{
                    if(arr[i-1]=='S'){
                        arr[i+1]='W';
                    }
                    else {
                        arr[i+1]='S';
                    }
                }
            }
            else {
                if(arr[i]=='S'){
                    if(arr[i-1]=='S'){
                        arr[i+1]='W';
                    }
                    else {
                        arr[i+1]='S';
                    }
                }
                else{
                    if(arr[i-1]=='S'){
                        arr[i+1]='S';
                    }
                    else {
                        arr[i+1]='W';
                    }
                }

            }
        }
    }
    static boolean printOut(char[]arr){
        boolean pass = true;
        int idex = n-1;
        if(s.charAt(idex)=='o'){
            if(arr[idex]=='S'){
                if(arr[idex-1]==arr[0]){
                    pass = true;
                }
                else {
                    pass=false;
                }
            }
            else {
                if(arr[idex-1]!=arr[0]){
                    pass = true;
                }
                else {
                    pass=false;
                }
            }
        }
        else {
            if(arr[idex]=='S'){
                if(arr[idex-1]!=arr[0]){
                    pass = true;
                }
                else {
                    pass=false;
                }
            }
            else {
                if(arr[idex-1]==arr[0]){
                    pass = true;
                }
                else {
                    pass=false;
                }
            }

        }
//        ------------------------------------------------------------
        if(pass){
            idex=n-2;
            if(s.charAt(idex)=='o'){
                if(arr[idex]=='S'){
                    if(arr[idex-1]==arr[idex+1]){
                        pass = true;
                    }
                    else {
                        pass=false;
                    }
                }
                else {
                    if(arr[idex-1]!=arr[idex+1]){
                        pass = true;
                    }
                    else {
                        pass=false;
                    }
                }
            }
            else {
                if(arr[idex]=='S'){
                    if(arr[idex-1]!=arr[idex+1]){
                        pass = true;
                    }
                    else {
                        pass=false;
                    }
                }
                else {
                    if(arr[idex-1]==arr[idex+1]){
                        pass = true;
                    }
                    else {
                        pass=false;
                    }
                }

            }
        }

//        ------------------------------------------------------------

        if(pass){
            for(int i =0;i<n;i++){
                System.out.print(arr[i]);
            }
            System.out.println();
            return true;
        }
        else {
            return false;
        }
    }
}
