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.*;
import java.util.*;

public class Main {
    public static PrintWriter out;
    public static FastScanner in;

    String s;
    int n;
    private void solve(){
        n = in.nextInt();
        s = in.nextLine();

        for(int i=0;i<=1;i++){
            for(int j=0;j<=1;j++){
                List<Integer> gt = check(i,j);
                if(gt.isEmpty()) continue;

                for(int k:gt){
                    if(k == 0){
                        out.print('S');
                    }else{
                        out.print('W');
                    }
                }
                return;
            }
        }
        out.print(-1);
        return;
    }

    private List<Integer> check(int a, int b){
        List<Integer> list = new ArrayList<>();
        list.add(a);list.add(b);

        for(int i=1;i<n-1;i++){
            if(list.get(i) == 1){
                if(s.charAt(i) == 'o'){
                    list.add(list.get(i-1)^1);
                }else{
                    list.add(list.get(i-1));
                }
            }else{
                if(s.charAt(i) == 'o'){
                    list.add(list.get(i-1));
                }else {
                    list.add(list.get(i-1)^1);
                }
            }
        }

        List<Integer> lt = new ArrayList<>();
        if(list.get(0) == 0){
            if(s.charAt(0) == 'o'){
                if(list.get(1) != list.get(n-1)) return lt;
            }else{
                if(list.get(1) == list.get(n-1)) return lt;
            }
        }
        if(list.get(0) == 1){
            if(s.charAt(0) == 'o'){
                if(list.get(1) == list.get(n-1)) return lt;
            }else{
                if(list.get(1) != list.get(n-1)) return lt;
            }
        }

        if(list.get(n-1) == 0){
            if(s.charAt(n-1) == 'o'){
                if(list.get(0) != list.get(n-2)) return lt;
            }else{
                if(list.get(0) == list.get(n-2)) return lt;
            }
        }
        if(list.get(n-1) == 1){
            if(s.charAt(n-1) == 'o'){
                if(list.get(0) == list.get(n-2)) return lt;
            }else{
                if(list.get(0) != list.get(n-2)) return lt;
            }
        }

        return list;

    }

    private void runIO() {
        in = new FastScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        solve();
        out.close();
    }
    private static class FastScanner {
        BufferedReader bufferedReader;
        StringTokenizer stringTokenizer;

        private FastScanner() {
            bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        }

        private String next() {
            if (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {
                try {
                    stringTokenizer = new StringTokenizer(bufferedReader.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return stringTokenizer.nextToken();
        }

        private int nextInt() {
            return Integer.parseInt(next());
        }

        private long nextLong() {
            return Long.parseLong(next());
        }

        private String nextLine() {
            String ret = "";
            try {
                ret = bufferedReader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return ret;
        }
    }

    public static void main(String[] args) {
        new Main().runIO();
    }
}
