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.*;

public class Main {
    public static void main(String args[]){
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        String s = scanner.nextLine();
        s = scanner.nextLine();
        boolean a[] = new boolean[N];
        boolean ans[] = new boolean[N];
        boolean checkAllx = true;
        boolean ok = false;

        for (int i = 0;i<s.length();i++){
            if (s.charAt(i)=='o') {
                a[i]=true;
                checkAllx = false;
            }else{
                a[i]=false;
            }
        }

        
        if (checkAllx) {
            for (int i = 0;i<N;i++){
                System.out.print("W");
            }
            System.exit(0);
        }

        //羊羊
        ans[0] = ans[1] = true;
        setAns(ans, a ,N);
        if (a[0]&&ans[N-1]) {//最後羊の時
            if(a[N-1]){//最後羊o
                if (ans[N-2]) {
                    output(ans);                    
                }
            }else{//最後羊x
                if(!ans[N-2]){
                    output(ans);
                }
            }
        }
        
        if (!a[0]&&!ans[N-1]) {//最後狼の時
            if(!a[N-1]){
                if (ans[N-2]) {
                    output(ans);                    
                }//最後狼x
            }else{
                if(!ans[N-2]){
                    output(ans);
                }//最後狼o
            }
        }

        //羊狼
        ans[0] = true;
        ans[1] = false;
        setAns(ans, a ,N);
        if (!a[0]&&ans[N-1]){//最後羊の時
            if (a[N-1]) {
                if (ans[N-2]) {
                    output(ans); 
                }//最後羊o
            }else{
                if (!ans[N-2]){//最後羊x
                    output(ans);
                }
            }
        }

        if(a[0]&&!ans[N-1]){//最後狼の時
            if (!a[N-1]){
                if (ans[N-2]){
                    output(ans);
                }
            }//最後狼x
            else{
                if (!ans[N-2]){
                    output(ans);
                }
            }
            //最後狼o
        }

        //狼狼
        ans[0] = ans[1] = false;
        setAns(ans, a ,N);
        if (a[0]&&ans[N-1]) {//最後羊の時
            if(a[N-1]){//最後羊o
                if (!ans[N-2]) {
                    output(ans);                    
                }
            }else{//最後羊x
                if(ans[N-2]){
                    output(ans);
                }
            }
        }
        
        if (!a[0]&&!ans[N-1]) {//最後狼の時
            if(!a[N-1]){
                if (!ans[N-2]) {
                    output(ans);                    
                }//最後狼x
            }else{
                if(ans[N-2]){
                    output(ans);
                }//最後狼o
            }
        }

        //狼羊
        ans[1] = true;
        ans[0] = false;
        setAns(ans, a ,N);
        if (!a[0]&&ans[N-1]){//最後羊の時
            if (a[N-1]) {
                if (!ans[N-2]) {
                    output(ans); 
                }//最後羊o
            }else{
                if (ans[N-2]){//最後羊x
                    output(ans);
                }
            }
        }

        if(a[0]&&!ans[N-1]){//最後狼の時
            if (!a[N-1]){
                if (!ans[N-2]){
                    output(ans);
                }
            }//最後狼x
            else{
                if (ans[N-2]){
                    output(ans);
                }
            }
            //最後狼o
        }

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

    static boolean[] setAns(boolean[] ans,boolean[] s,int z){
        for (int i = 2;i < z;i++){
            boolean ox;//trueなら隣同じ
            if (ans[i-1] == true){
                if (s[i-1] == true){
                    ox = true;
                }else{
                    ox = false;
                }
            }else{
                if (s[i-1] == true){
                    ox = false;
                }else{
                    ox = true;
                }
            }

            if(ox){
                ans[i] = ans[i-2];
            }else{
                ans[i] = !ans[i-2];
            }
        }
        return ans;
    }

    static void output(boolean x[]){
        for (boolean b : x) {
            if (b) {
                System.out.print("S");
            } else {
                System.out.print("W");
            }
        }
        System.exit(0);
    }
}