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

/**
 * Created by Seiya on 2016/10/16.
 */

public class Main {

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

        char[][] ans = new char[4][N];

        ans[0][0] = 'S';
        ans[0][1] = 'S';
        ans[1][0] = 'W';
        ans[1][1] = 'W';
        ans[2][0] = 'S';
        ans[2][1] = 'W';
        ans[3][0] = 'W';
        ans[3][1] = 'S';

        int flag = -1;
        for (int i = 0; i < 4; i++) {
            for (int j = 2; j < N; j++) {
                if(s.charAt(j - 1) == 'o'){
                    if(ans[i][j - 1] == 'S'){
                        ans[i][j] = ans[i][j - 2];
                    }else{
                        ans[i][j] = rev(ans[i][j - 2]);
                    }
                }else{
                    if(ans[i][j - 1] == 'W'){
                        ans[i][j] = ans[i][j - 2];
                    }else{
                        ans[i][j] = rev(ans[i][j - 2]);
                    }

                }
            }
            Boolean a = check(s.charAt(N - 1), ans[i][N - 1], ans[i][N - 2], ans[i][0]);
            Boolean b = check(s.charAt(0), ans[i][0], ans[i][N - 1], ans[i][1]);
            if(a && b){
                flag = i;
                break;
            }

        }


        if(flag == -1){
            System.out.println(-1);
        }else{
            for (int i = 0; i < N; i++) {
                System.out.print(ans[flag][i]);
            }
            System.out.println();
        }


    } // mainMethod

    public static char rev(char c){
        if(c == 'S'){
            return 'W';
        }else{
            return 'S';
        }
    }

    public static Boolean check(char say, char ani, char kind1, char kind2){
        if(say == 'o'){
            if(ani == 'S'){
                return kind1 == kind2;
            }else{
                return kind1 != kind2;
            }

        }else{
            if(ani == 'S'){
                return kind1 != kind2;
            }else{
                return kind1 == kind2;
            }

        }

    }


} // MainClass
