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.Scanner;
public class Main{
	public static void main(String[] args){
		Scanner sc=new Scanner(System.in);
		int n = sc.nextInt();
		String s = sc.next();
		int[] e=new int[n+1];
		for(int i = 0; i<4; i++){
			int k = i;
			int a = ((k&1)==0)?1:-1;
			k>>=1;
			int b = ((k&1)==0)?1:-1;
			e[0]=a;
			e[1]=b;
			boolean judge=false;
			for(int j = 2; j<=n; j++){
				if(e[j-1]==1){
					e[j]=(s.charAt(j-1)=='o')?e[j-2]:-e[j-2];
				}else{
					e[j]=(s.charAt(j-1)=='o')?-e[j-2]:e[j-2];
				}
			}
			if(e[0]==1){
				if(s.charAt(0)=='o'){
					judge=e[n-1]==e[1];
				}else{
					judge=e[n-1]==-e[1];
				}
			}else{
				if(s.charAt(0)=='o'){
					judge=e[n-1]==-e[1];
				}else{
					judge=e[n-1]==e[1];
				}
			}
			if(judge && e[0]==e[n]){
				StringBuffer ans=new StringBuffer();
				for(int q = 0; q<n; q++){
					ans.append((e[q]==1)?"S":"W");
				}
				System.out.println(ans);
				return;
			}
		}
		System.out.println(-1);
	}
}
